Matching on the Line Admits no o(√log n)-Competitive Algorithm.
Enoch PesericoMichele ScquizzatoPublished in: ACM Trans. Algorithms (2023)
Keyphrases
- matching algorithm
- worst case
- tree structure
- image matching
- detection algorithm
- times faster
- preprocessing
- cost function
- experimental evaluation
- optimization algorithm
- string matching
- k means
- search space
- computational complexity
- optimal solution
- convex hull
- matching process
- data sets
- line segments
- similarity measure
- convergence rate
- recognition algorithm
- genetic algorithm