Locality-sensitive hashing of curves
From MaRDI portal
Recommendations
Cited in
(18)- Probabilistic embeddings of the Fréchet distance
- Efficient nearest-neighbor query and clustering of planar curves
- FRESH: Fréchet similarity with hashing
- The VC dimension of metric balls under Fréchet and Hausdorff distances
- Approximate nearest neighbor for curves: simple, efficient, and deterministic
- The VC dimension of metric balls under Fréchet and Hausdorff distances
- Dynamic Time Warping in Strongly Subquadratic Time: Algorithms for the Low-Distance Regime and Approximate Evaluation
- scientific article; zbMATH DE number 7236441 (Why is no real title available?)
- scientific article; zbMATH DE number 7758314 (Why is no real title available?)
- Pattern matching under DTW distance
- (1+)-ANN data structure for curves via subspaces of bounded doubling dimension
- Random projections for curves in high dimensions
- Approximate nearest neighbor for curves -- simple, efficient, and deterministic
- Range reporting for time series via rectangle stabbing
- Static and streaming data structures for Fréchet distance queries
- Locality sensitive hashing for efficient similar polygon retrieval
- Improved space-efficient approximate nearest neighbor search using function inversion
- ANN for time series under the Fréchet distance
This page was built for publication: Locality-sensitive hashing of curves
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4580112)