ANN for time series under the Fréchet distance
From MaRDI portal
Publication:832871
DOI10.1007/978-3-030-83508-8_23OpenAlexW3082204697MaRDI QIDQ832871
Publication date: 25 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-83508-8_23
Related Items (2)
On approximate near-neighbors search under the (continuous) Fréchet distance in higher dimensions ⋮ Approximate nearest neighbor for curves: simple, efficient, and deterministic
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fast Fréchet queries
- Efficient nearest-neighbor query and clustering of planar curves
- Fast algorithms for approximate Fréchet matching queries in geometric trees
- The VC dimension of metric balls under Fréchet and Hausdorff distances
- Lower bounds for union-split-find related problems on random access machines
- Approximability of the discrete Fréchet distance
- Storing a Sparse Table with 0 (1) Worst Case Access Time
- Approximate nearest neighbor algorithms for Frechet distance via product metrics
- Clustering time series under the Fréchet distance
- Algorithms for the discrete Fréchet distance under translation
- Fast Construction of Nets in Low-Dimensional Metrics and Their Applications
This page was built for publication: ANN for time series under the Fréchet distance