The Stochastic Matching Problem: Beating Half with a Non-Adaptive Algorithm.
Sepehr AssadiSanjeev KhannaYang LiPublished in: EC (2017)
Keyphrases
- matching algorithm
- computational complexity
- preprocessing
- experimental evaluation
- detection algorithm
- learning algorithm
- matching scheme
- monte carlo
- np hard
- similarity measure
- high accuracy
- computational cost
- image matching
- graph matching
- improved algorithm
- matching process
- stochastic approximation
- dynamic programming
- segmentation algorithm
- clustering method
- ant colony optimization
- computationally efficient
- expectation maximization
- times faster
- image set
- cost function
- significant improvement
- search space
- optimal solution
- reinforcement learning