An Optimized Divide-and-Conquer Algorithm for the Closest-Pair Problem in the Planar Case.
José C. PereiraFernando G. LoboPublished in: J. Comput. Sci. Technol. (2012)
Keyphrases
- detection algorithm
- learning algorithm
- optimal solution
- theoretical analysis
- cost function
- preprocessing
- matching algorithm
- dynamic programming
- times faster
- computational complexity
- np hard
- probabilistic model
- worst case
- high accuracy
- input data
- pairwise
- segmentation algorithm
- optimization algorithm
- objective function
- similarity measure
- search algorithm
- recognition algorithm
- convex hull
- feature selection
- classification algorithm
- data sets
- k means