(n^2) Time Algorithm for the Minimal Permutation Completion Problem.
Christophe CrespelleAnthony PerezIoan TodincaPublished in: WG (2015)
Keyphrases
- learning algorithm
- detection algorithm
- np hard
- single pass
- improved algorithm
- times faster
- segmentation algorithm
- k means
- cost function
- selection algorithm
- dynamic programming
- experimental study
- high accuracy
- preprocessing
- space complexity
- recognition algorithm
- multiscale
- objective function
- computationally efficient
- input data
- worst case
- experimental evaluation
- computational complexity
- search space
- optimal solution
- linear programming
- energy function
- classification algorithm
- matching algorithm
- path planning
- mobile robot
- convergence rate
- similarity measure
- neural network