Zobrazeno 1 - 10
of 917
pro vyhledávání: '"Driemel, A."'
Autor:
Blank, Lotte, Driemel, Anne
The fine-grained complexity of computing the Fr\'echet distance has been a topic of much recent work, starting with the quadratic SETH-based conditional lower bound by Bringmann from 2014. Subsequent work established largely the same complexity lower
Externí odkaz:
http://arxiv.org/abs/2404.18738
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 sequence that minimises the sum of dynamic time warping distances (DTW)
Externí odkaz:
http://arxiv.org/abs/2401.05841
Autor:
Blank, Lotte, Driemel, Anne
We study the Fr\'echet queries problem. It is a data structure problem, where we are given a set $S$ of $n$ polygonal curves and a distance threshold $\rho$. The data structure should support queries with a polygonal curve $q$ for the elements of $S$
Externí odkaz:
http://arxiv.org/abs/2401.03762
Since its introduction to computational geometry by Alt and Godau in 1992, the Fr\'echet distance has been a mainstay of algorithmic research on curve similarity computations. The focus of the research has been on comparing polygonal curves, with the
Externí odkaz:
http://arxiv.org/abs/2401.03339
Autor:
Conradi, Jacobus, Driemel, Anne
Clustering trajectories is a central challenge when confronted with large amounts of movement data such as full-body motion data or GPS data. We study a clustering problem that can be stated as a geometric set cover problem: Given a polygonal curve o
Externí odkaz:
http://arxiv.org/abs/2308.14865
Autor:
Brüning, Frederik, Driemel, Anne
We study range spaces, where the ground set consists of either polygonal curves in $\mathbb{R}^d$ or polygonal regions in the plane that may contain holes and the ranges are balls defined by an elastic distance measure, such as the Hausdorff distance
Externí odkaz:
http://arxiv.org/abs/2308.05998
We consider the $(1+\varepsilon)$-Approximate Nearest Neighbour (ANN) Problem for polygonal curves in $d$-dimensional space under the Fr\'echet distance and ask to what extent known data structures for doubling spaces can be applied to this problem.
Externí odkaz:
http://arxiv.org/abs/2307.08521
Autor:
de Heuvel, Jorge, Corral, Nathan, Kreis, Benedikt, Conradi, Jacobus, Driemel, Anne, Bennewitz, Maren
For the best human-robot interaction experience, the robot's navigation policy should take into account personal preferences of the user. In this paper, we present a learning framework complemented by a perception pipeline to train a depth vision-bas
Externí odkaz:
http://arxiv.org/abs/2210.01683
Autor:
Bonerath, Annika, Driemel, Anne, Haunert, Jan-Henrik, Haverkort, Herman, Langetepe, Elmar, Niedermann, Benjamin
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 position, a timestamp, and a weight. Let a time-window labeling be a sele
Externí odkaz:
http://arxiv.org/abs/2209.00913
Publikováno v:
SPIRE: String Processing and Information Retrieval, Nov 2022, Concepci{\'o}n, Chile
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 produced by the third generation sequencing. To measure the DTW distance be
Externí odkaz:
http://arxiv.org/abs/2208.14669