An Optimal Deterministic Algorithm for Online b-Matching.
Bala KalyanasundaramKirk PruhsPublished in: FSTTCS (1996)
Keyphrases
- dynamic programming
- matching algorithm
- optimal solution
- worst case
- learning algorithm
- locally optimal
- detection algorithm
- exhaustive search
- simulated annealing
- search space
- preprocessing
- experimental evaluation
- computational complexity
- times faster
- cost function
- significant improvement
- high accuracy
- online learning
- objective function
- image matching
- path planning
- relaxation algorithm
- minimum distance
- approximate matching
- segmentation algorithm
- linear programming
- computational cost
- search algorithm
- image segmentation