Linear-time algorithm for finding a maximum-density segment of a sequence.
Sung Kwon KimPublished in: Inf. Process. Lett. (2003)
Keyphrases
- preprocessing
- computational cost
- improved algorithm
- optimization algorithm
- learning algorithm
- optimal solution
- computational complexity
- recognition algorithm
- times faster
- path planning
- worst case
- data sets
- matching algorithm
- significant improvement
- computationally efficient
- detection algorithm
- linear programming
- experimental evaluation
- np hard
- classification algorithm
- high accuracy
- tree structure
- theoretical analysis
- simulated annealing
- probabilistic model
- k means
- evolutionary algorithm
- neural network