A Simple Randomized O(n log n)-Time Closest-Pair Algorithm in Doubling Metrics.
Anil MaheshwariWolfgang MulzerMichiel H. M. SmidPublished in: CoRR (2020)
Keyphrases
- dynamic programming
- learning algorithm
- worst case
- search space
- np hard
- objective function
- particle swarm optimization
- cost function
- experimental evaluation
- computational cost
- high accuracy
- linear programming
- selection algorithm
- matching algorithm
- segmentation algorithm
- k means
- preprocessing
- input data
- randomized algorithm
- theoretical analysis
- detection algorithm
- improved algorithm
- ant colony optimization
- computational complexity
- times faster
- recognition algorithm
- optimal solution
- clustering method
- randomized algorithms
- input image
- computationally efficient
- neural network