Optimum Partition Parameter of Divide-and-Conquer Algorithm for Solving Closest-Pair Problem
Mohammad Zaidul KarimNargis AkterPublished in: CoRR (2011)
Keyphrases
- detection algorithm
- dynamic programming
- improved algorithm
- experimental evaluation
- learning algorithm
- optimal parameters
- k means
- cost function
- computational complexity
- high accuracy
- optimal solution
- segmentation algorithm
- search space
- theoretical analysis
- times faster
- probabilistic model
- significant improvement
- convergence rate
- global optimum
- matching algorithm
- disjoint subsets
- parameter tuning
- parameter estimation
- computationally efficient
- input data
- simulated annealing
- nearest neighbor
- data points
- np hard
- multi objective
- preprocessing
- objective function