activity
20192021
most citedSublinear data structures for short Fréchet queries

5 citations · 5 across the 2 of their papers we have counts for

collaborators

5 papers

cs.CG2021

Tight Bounds for Approximate Near Neighbor Searching for Time Series under the Fréchet Distance

Karl Bringmann, Anne Driemel, André Nusser +1

We study the -approximate near neighbor problem under the continuous Fréchet distance: Given a set of polygonal curves with vertices, a radius , and a parameter $k…

cs.CG2020

-ANN for time series under the Fréchet distance

Anne Driemel, Ioannis Psarros

We study approximate-near-neighbor data structures for time series under the continuous Fréchet distance. For an attainable approximation factor and a query radius , an ap…

cs.CG20195 cited

Sublinear data structures for short Fréchet queries

Anne Driemel, Ioannis Psarros, Melanie Schmidt

We study metric data structures for curves in doubling spaces, such as trajectories of moving objects in Euclidean , where the distance between two curves is measured…

cs.CG2019

The VC Dimension of Metric Balls under Fréchet and Hausdorff Distances

Anne Driemel, André Nusser, Jeff M. Phillips +1

The Vapnik-Chervonenkis dimension provides a notion of complexity for systems of sets. If the VC dimension is small, then knowing this can drastically simplify fundamental computat…

cs.CG2019

Near neighbor preserving dimension reduction for doubling subsets of

Ioannis Z. Emiris, Vasilis Margonis, Ioannis Psarros

Randomized dimensionality reduction has been recognized as one of the fundamental techniques in handling high-dimensional data. Starting with the celebrated Johnson-Lindenstrauss L…