Fréchet Distance Under Translation: Conditional Hardness and an Algorithm via Offline Dynamic Grid Reachability.
Karl BringmannMarvin KünnemannAndré NusserPublished in: SODA (2019)
Keyphrases
- cost function
- np hard
- computational complexity
- preprocessing
- high accuracy
- dynamic programming
- matching algorithm
- experimental evaluation
- learning algorithm
- worst case
- k means
- optimal solution
- objective function
- real time
- significant improvement
- improved algorithm
- times faster
- detection algorithm
- optimization algorithm
- randomly generated
- recognition algorithm
- information theoretic
- expectation maximization
- image segmentation
- similarity measure
- upper bound
- state space
- computational cost
- bayesian networks
- search space