){\mathcal{O}}(n^2)-time Algorithm for the Minimal Interval Completion Problem.
Christophe CrespelleIoan TodincaPublished in: TAMC (2010)
Keyphrases
- computational complexity
- computational cost
- k means
- detection algorithm
- recognition algorithm
- preprocessing
- cost function
- dynamic programming
- worst case
- high accuracy
- neural network
- selection algorithm
- times faster
- path planning
- experimental study
- segmentation algorithm
- computationally efficient
- search space
- similarity measure
- data sets
- input data
- np hard
- tree structure
- optimal solution
- objective function
- memory requirements
- improved algorithm