The Stochastic Matching Problem: Beating Half with a Non-Adaptive Algorithm.
Sepehr AssadiSanjeev KhannaYang LiPublished in: CoRR (2017)
Keyphrases
- matching algorithm
- np hard
- dynamic programming
- image matching
- objective function
- computational complexity
- matching process
- times faster
- search space
- classification algorithm
- monte carlo
- segmentation algorithm
- approximate matching
- optimization algorithm
- detection algorithm
- improved algorithm
- string matching
- cost function
- k means
- theoretical analysis
- computationally efficient
- expectation maximization
- pattern matching
- tree structure
- linear programming
- simulated annealing
- worst case
- denoising
- computational cost
- convex hull
- recognition algorithm
- experimental evaluation
- data sets