An O(n log n) Algorithm for Finding a Shortest Central Link Segment.
Lyudmil AleksandrovHristo N. DjidjevJörg-Rüdiger SackPublished in: Int. J. Comput. Geom. Appl. (2000)
Keyphrases
- worst case
- detection algorithm
- computational complexity
- times faster
- matching algorithm
- learning algorithm
- improved algorithm
- simulated annealing
- preprocessing
- search space
- computational cost
- cost function
- theoretical analysis
- segmentation algorithm
- probabilistic model
- experimental evaluation
- objective function
- ant colony optimization
- optimization algorithm
- social networks
- classification algorithm
- convergence rate
- computationally efficient
- expectation maximization
- dynamic programming
- lower bound
- optimal solution
- maximum likelihood
- high accuracy
- upper bound
- knn
- multi objective
- k means
- face recognition