A o(n)-Competitive Deterministic Algorithm for Online Matching on a Line.
Antonios AntoniadisNeal BarceloMichael NugentKirk PruhsMichele ScquizzatoPublished in: Algorithmica (2019)
Keyphrases
- matching algorithm
- objective function
- np hard
- theoretical analysis
- learning algorithm
- optimization algorithm
- high accuracy
- worst case
- probabilistic model
- computational cost
- dynamic programming
- k means
- optimal solution
- string matching
- times faster
- experimental evaluation
- significant improvement
- search space
- computational complexity
- segmentation algorithm
- image matching
- improved algorithm
- finite state automaton
- line detection
- matching scheme
- recognition algorithm
- image set
- genetic algorithm
- clustering method
- similarity measure
- particle swarm optimization