research
∙
08/28/2023
Finding Complex Patterns in Trajectory Data via Geometric Set Cover
Clustering trajectories is a central challenge when confronted with larg...
share
research
∙
08/11/2023
Simplified and Improved Bounds on the VC-Dimension for Elastic Distance Measures
We study range spaces, where the ground set consists of polygonal curves...
research
∙
07/17/2023
(1+ε)-ANN Data Structure for Curves via Subspaces of Bounded Doubling Dimension
We consider the (1+ε)-Approximate Nearest Neighbour (ANN) Problem for po...
research
∙
09/02/2022
Analysis of a Greedy Heuristic for the Labeling of a Map with a Time-Window Interface
In this paper, we analyze the approximation quality of a greedy heuristi...
research
∙
08/31/2022
Pattern matching under DTW distance
In this work, we consider the problem of pattern matching under the dyna...
research
∙
04/21/2022
Faster Approximate Covering of Subcurves under the Fréchet Distance
Subtrajectory clustering is an important variant of the trajectory clust...
research
∙
03/14/2022
Minimum-Error Triangulations for Sea Surface Reconstruction
We apply state-of-the-art computational geometry methods to the problem ...
research
∙
02/23/2022
On Computing the k-Shortcut Fréchet Distance
The Fréchet distance is a popular measure of dissimilarity for polygonal...
research
∙
01/06/2022
On the Discrete Fréchet Distance in a Graph
The Fréchet distance is a well-studied similarity measure between curves...
research
∙
12/01/2021
Approximating Length-Restricted Means under Dynamic Time Warping
We study variants of the mean problem under the p-Dynamic Time Warping (...
research
∙
07/16/2021
Tight Bounds for Approximate Near Neighbor Searching for Time Series under the Fréchet Distance
We study the c-approximate near neighbor problem under the continuous Fr...
research
∙
03/10/2021
Subtrajectory Clustering: Finding Set Covers for Set Systems of Subcurves
We study subtrajectory clustering under the Fréchet distance. Given one ...
research
∙
09/14/2020
Spatio-Temporal Top-k Similarity Search for Trajectories in Graphs
We study the problem of finding the k most similar trajectories to a giv...
research
∙
09/03/2020
Approximating (k,â„“)-Median Clustering for Polygonal Curves
In 2015, Driemel, Krivošija and Sohler introduced the (k,ℓ)-median probl...
research
∙
08/21/2020
(2+ε)-ANN for time series under the Fréchet distance
We study approximate-near-neighbor data structures for time series under...
research
∙
07/09/2019
Sublinear data structures for short Fréchet queries
We study metric data structures for curves in doubling spaces, such as t...
research
∙
03/07/2019
The VC Dimension of Metric Balls under Fréchet and Hausdorff Distances
The Vapnik-Chervonenkis dimension provides a notion of complexity for sy...
research
∙
02/21/2019
On the hardness of computing an average curve
We study the complexity of clustering curves under k-median and k-center...
research
∙
09/07/2018
FRESH: Fréchet Similarity with Hashing
Massive datasets of curves, such as time series and trajectories, are co...
research
∙
08/06/2018
Probabilistic embeddings of the Fréchet distance
The Fréchet distance is a popular distance measure for curves which natu...
research
∙
05/03/2018
Approximating (k,â„“)-center clustering for curves
The Euclidean k-center problem is a classical problem that has been exte...
research
∙
07/15/2017
