A simple randomized $O(n \log n)$-time closest-pair algorithm in doubling metrics.
Michiel SmidAnil MaheshwariWolfgang MulzerPublished in: J. Comput. Geom. (2020)
Keyphrases
- detection algorithm
- experimental evaluation
- learning algorithm
- expectation maximization
- computational complexity
- worst case
- optimization algorithm
- preprocessing
- high accuracy
- selection algorithm
- theoretical analysis
- improved algorithm
- np hard
- data sets
- matching algorithm
- linear programming
- neural network
- dynamic programming
- probabilistic model
- particle swarm optimization
- multi objective
- significant improvement
- segmentation algorithm
- search space
- training set
- lower bound
- distance metric
- times faster
- recognition algorithm
- objective function
- similarity measure
- log log