Computational Experience with an Approximation Algorithm on Large-Scale Euclidean Matching Instances.
David P. WilliamsonMichel X. GoemansPublished in: SODA (1994)
Keyphrases
- matching algorithm
- randomly generated
- detection algorithm
- learning algorithm
- computational complexity
- preprocessing
- image matching
- computational cost
- recognition algorithm
- error bounds
- worst case
- optimization algorithm
- probabilistic model
- closed form
- dynamic programming
- k means
- search space
- matching scheme
- matching process
- particle filter
- string matching
- image set
- linear programming
- cost function
- objective function
- similarity measure