An Optimized Divide-and-Conquer Algorithm for the Closest-Pair Problem in the Planar Case
José C. PereiraFernando G. LoboPublished in: CoRR (2010)
Keyphrases
- detection algorithm
- objective function
- search space
- times faster
- computational complexity
- experimental evaluation
- learning algorithm
- worst case
- computational cost
- preprocessing
- np hard
- recognition algorithm
- classification algorithm
- optimization algorithm
- theoretical analysis
- computationally efficient
- input data
- expectation maximization
- lower bound
- significant improvement
- data structure
- ant colony optimization
- dynamic programming
- matching algorithm
- data sets
- cost function
- improved algorithm