ANN for time series under the Fréchet distance
From MaRDI portal
Publication:832871
DOI10.1007/978-3-030-83508-8_23OpenAlexW3082204697MaRDI QIDQ832871FDOQ832871
Authors: Anne Driemel, Ioannis Psarros
Publication date: 25 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-83508-8_23
Cites Work
- Storing a Sparse Table with 0 (1) Worst Case Access Time
- Fast Construction of Nets in Low-Dimensional Metrics and Their Applications
- Approximate nearest neighbor: towards removing the curse of dimensionality
- Approximability of the discrete Fréchet distance
- Title not available (Why is that?)
- Lower bounds for union-split-find related problems on random access machines
- Clustering time series under the Fréchet distance
- 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
- Approximate nearest neighbor algorithms for Frechet distance via product metrics
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Algorithms for the discrete Fréchet distance under translation
Cited In (2)
This page was built for publication: ANN for time series under the Fréchet distance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q832871)