A New Plane-Sweep Algorithm for the K-Closest-Pairs Query.
George RoumelisMichael VassilakopoulosAntonio CorralYannis ManolopoulosPublished in: SOFSEM (2014)
Keyphrases
- detection algorithm
- significant improvement
- computational complexity
- simulated annealing
- database
- preprocessing
- cost function
- dynamic programming
- matching algorithm
- expectation maximization
- convergence rate
- worst case
- data sources
- experimental evaluation
- recognition algorithm
- k means
- similarity measure
- search mechanism
- computational cost
- multi dimensional
- np hard
- three dimensional