Matching on the Line Admits No o(√log n)-Competitive Algorithm.
Enoch PesericoMichele ScquizzatoPublished in: ICALP (2021)
Keyphrases
- matching algorithm
- preprocessing
- optimization algorithm
- times faster
- worst case
- learning algorithm
- computational complexity
- detection algorithm
- dynamic programming
- improved algorithm
- significant improvement
- computational cost
- np hard
- computationally efficient
- simulated annealing
- high accuracy
- experimental evaluation
- recognition algorithm
- matching process
- objective function
- data sets
- image matching
- genetic algorithm
- pattern matching
- stereo correspondence
- cost function
- similarity measure
- expectation maximization
- probabilistic model
- mobile robot
- k means
- search space
- optimal solution
- matching scheme
- line detection
- approximate matching