A Simple Yet Fast Algorithm for the Closest-Pair Problem Using Sorted Projections on Multi-Dimensions.
Mehmet Emin DalkiliçSerkan ErgunPublished in: ISCIS (2013)
Keyphrases
- computational complexity
- significant improvement
- experimental evaluation
- optimization algorithm
- optimal solution
- np hard
- high accuracy
- theoretical analysis
- computationally efficient
- search space
- iterative algorithms
- dynamic programming
- times faster
- convex hull
- matching algorithm
- worst case
- probabilistic model
- computational cost
- improved algorithm
- recognition algorithm
- discrete tomography
- convergence rate
- shortest path
- input data
- cost function
- k means