An Optimal Algorithm for Closest-Pair Maintenance.
Sergei BespamyatnikhPublished in: Discret. Comput. Geom. (1998)
Keyphrases
- dynamic programming
- times faster
- cost function
- optimal solution
- worst case
- np hard
- experimental evaluation
- learning algorithm
- theoretical analysis
- objective function
- preprocessing
- globally optimal
- optimality criterion
- expectation maximization
- high accuracy
- k means
- recognition algorithm
- improved algorithm
- optimal parameters
- particle swarm optimization
- closed form
- tree structure
- detection algorithm
- computationally efficient
- significant improvement
- computational complexity
- matching algorithm
- path planning
- scheduling problem
- computational cost
- locally optimal
- similarity measure