5 papers
On the number of iterations of the DBA algorithm
Frederik Brüning, Anne Driemel, Alperen Ergür +1
The DTW Barycenter Averaging (DBA) algorithm is a widely used algorithm for estimating the mean of a given set of point sequences. In this context, the mean is defined as a point s…
Revisiting the Fréchet distance between piecewise smooth curves
Jacobus Conradi, Anne Driemel, Benedikt Kolbe
Since its introduction to computational geometry by Alt and Godau in 1992, the Fréchet distance has been a mainstay of algorithmic research on curve similarity computations. The fo…
Analysis of a Greedy Heuristic for the Labeling of a Map with a Time-Window Interface
Annika Bonerath, Anne Driemel, Jan-Henrik Haunert +3
In this paper, we analyze the approximation quality of a greedy heuristic for automatic map labeling. As input, we have a set of events, each associated with a label at a fixed pos…
Pattern matching under DTW distance
Garance Gourdel, Anne Driemel, Pierre Peterlongo +1
In this work, we consider the problem of pattern matching under the dynamic time warping (DTW) distance motivated by potential applications in the analysis of biological data produ…
Approximating Length-Restricted Means under Dynamic Time Warping
Maike Buchin, Anne Driemel, Koen van Greevenbroek +2
We study variants of the mean problem under the -Dynamic Time Warping (-DTW) distance, a popular and robust distance measure for sequential data. In our setting we are given…