Pages that link to "Item:Q2970465"
From MaRDI portal
The following pages link to Approximability of the discrete Fréchet distance (Q2970465):
Displaying 12 items.
- Computing the Fréchet distance with a retractable leash (Q312142) (← links)
- ANN for time series under the Fréchet distance (Q832871) (← links)
- An improved approximation algorithm for the discrete Fréchet distance (Q1653046) (← links)
- Fine-grained complexity theory: conditional lower bounds for computational geometry (Q2117766) (← links)
- Approximating the geometric edit distance (Q2165024) (← links)
- Four Soviets walk the dog: improved bounds for computing the Fréchet distance (Q2408191) (← links)
- Walking the Dog Fast in Practice: Algorithm Engineering of the Fréchet Distance (Q5088944) (← links)
- The Orthogonal Vectors Conjecture for Branching Programs and Formulas (Q5090426) (← links)
- Dynamic Time Warping in Strongly Subquadratic Time: Algorithms for the Low-Distance Regime and Approximate Evaluation (Q5091239) (← links)
- Fast Fréchet Distance Between Curves with Long Edges (Q5197493) (← links)
- Computing the Fréchet distance between uncertain curves in one dimension (Q5896889) (← links)
- Computing the Fréchet distance between uncertain curves in one dimension (Q5918556) (← links)
