An Optimal Algorithm for the Maximum-Density Segment Problem.
Kai-Min ChungHsueh-I LuPublished in: SIAM J. Comput. (2004)
Keyphrases
- dynamic programming
- worst case
- optimal solution
- computational cost
- detection algorithm
- experimental evaluation
- preprocessing
- matching algorithm
- cost function
- k means
- learning algorithm
- recognition algorithm
- improved algorithm
- significant improvement
- computational complexity
- classification algorithm
- locally optimal
- optimization algorithm
- closed form
- theoretical analysis
- times faster
- expectation maximization
- high accuracy
- optimal path
- upper bound
- globally optimal
- space complexity
- path planning
- linear programming
- tree structure
- segmentation algorithm
- computationally efficient
- probabilistic model
- np hard
- lower bound
- video sequences
- objective function
- similarity measure