A complexity theorem for the Novelli-Pak-Stoyanovskii algorithm.
Christoph NeumannRobin SulzgruberPublished in: J. Comb. Theory, Ser. A (2015)
Keyphrases
- worst case
- detection algorithm
- computational complexity
- search space
- optimal solution
- cost function
- space complexity
- improved algorithm
- particle swarm optimization
- linear complexity
- computationally efficient
- high accuracy
- memory requirements
- classification algorithm
- decision problems
- times faster
- recognition algorithm
- estimation algorithm
- dynamic programming
- k means
- selection algorithm
- path planning
- expectation maximization
- matching algorithm
- clustering method
- segmentation algorithm
- data sets
- input data
- simulated annealing
- motion estimation
- computational cost
- experimental evaluation
- np hard
- similarity measure