An O(nlogn) algorithm for the zoo-keeper's problem.
Sergei BespamyatnikhPublished in: Comput. Geom. (2003)
Keyphrases
- experimental evaluation
- detection algorithm
- optimization algorithm
- high accuracy
- dynamic programming
- computationally efficient
- single pass
- learning algorithm
- improved algorithm
- computational complexity
- probabilistic model
- k means
- theoretical analysis
- times faster
- preprocessing
- np hard
- simulated annealing
- experimental study
- similarity measure
- estimation algorithm
- convergence rate
- path planning
- matching algorithm
- tree structure
- image restoration
- segmentation algorithm
- support vector machine svm
- search space
- expectation maximization
- worst case
- computational cost