Asymptotics of Divide-and-Conquer Recurrences: Batcher's Sorting Algorithm and a Minimum Euclidean Matching Heuristic.
Hsien-Kuei HwangPublished in: Algorithmica (1998)
Keyphrases
- matching algorithm
- dynamic programming
- optimal solution
- combinatorial optimization
- learning algorithm
- image matching
- depth first search
- matching process
- k means
- cost function
- np hard
- simulated annealing
- segmentation algorithm
- string matching
- knapsack problem
- detection algorithm
- probabilistic model
- computational complexity
- similarity measure
- linear programming
- solution quality
- square error
- convergence rate
- optimization algorithm
- worst case
- search space
- decision trees