Følg
Anne Driemel
Anne Driemel
Professor, Hausdorff Center for Mathematics, University of Bonn
Verificeret mail på informatik.uni-bonn.de - Startside
Titel
Citeret af
Citeret af
År
Approximating the Fréchet distance for realistic curves in near linear time
A Driemel, S Har-Peled, C Wenk
Proceedings of the twenty-sixth annual symposium on Computational geometry …, 2010
1952010
Segmenting trajectories: A framework and algorithms using spatiotemporal criteria
M Buchin, A Driemel, M Van Kreveld, V Sacristán
Journal of Spatial Information Science 2011 (3), 33-63, 2011
1732011
Jaywalking your dog: computing the Fréchet distance with shortcuts
A Driemel, S Har-Peled
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete …, 2012
1302012
Approximate map matching with respect to the Fréchet distance
D Chen, A Driemel, LJ Guibas, A Nguyen, C Wenk
2011 Proceedings of the Thirteenth Workshop on Algorithm Engineering and …, 2011
1152011
An algorithmic framework for segmenting trajectories based on spatio-temporal criteria
M Buchin, A Driemel, M Van Kreveld, V Sacristán
Proceedings of the 18th SIGSPATIAL International Conference on Advances in …, 2010
982010
Clustering time series under the Fréchet distance
A Driemel, A Krivošija, C Sohler
Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete …, 2016
902016
Locality-sensitive hashing of curves
A Driemel, F Silvestri
arXiv preprint arXiv:1703.04040, 2017
762017
Approximating (k, ℓ)-center clustering for curves
K Buchin, A Driemel, J Gudmundsson, M Horton, I Kostitsyna, M Löffler, ...
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
612019
Segmentation of trajectories on nonmonotone criteria
B Aronov, A Driemel, MV Kreveld, M Löffler, F Staals
ACM Transactions on Algorithms (TALG) 12 (2), 1-28, 2015
512015
klcluster: Center-based clustering of trajectories
K Buchin, A Driemel, N van de L'Isle, A Nusser
Proceedings of the 27th ACM SIGSPATIAL International Conference on Advances …, 2019
412019
On the complexity of range searching among curves
P Afshani, A Driemel
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018
412018
Computing the Fréchet distance with shortcuts is NP-hard
M Buchin, A Driemel, B Speckmann
Proceedings of the thirtieth annual symposium on Computational geometry, 367-376, 2014
392014
The VC dimension of metric balls under Fréchet and Hausdorff distances
A Driemel, A Nusser, JM Phillips, I Psarros
Discrete & Computational Geometry 66 (4), 1351-1381, 2021
322021
On the hardness of computing an average curve
K Buchin, A Driemel, M Struijs
arXiv preprint arXiv:1902.08053, 2019
282019
Approximating (k,ℓ)-Median Clustering for Polygonal Curves
M Buchin, A Driemel, D Rohde
ACM Transactions on Algorithms 19 (1), 1-32, 2023
242023
Tight bounds for approximate near neighbor searching for time series under the Fréchet distance
K Bringmann, A Driemel, A Nusser, I Psarros
Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022
232022
ANN for time series under the Fréchet distance
A Driemel, I Psarros
Algorithms and Data Structures: 17th International Symposium, WADS 2021 …, 2021
23*2021
Computing the Fréchet distance between folded polygons
AF Cook, A Driemel, S Har-Peled, J Sherette, C Wenk
Algorithms and Data Structures: 12th International Symposium, WADS 2011, New …, 2011
212011
FRESH: Fréchet similarity with hashing
M Ceccarello, A Driemel, F Silvestri
Algorithms and Data Structures: 16th International Symposium, WADS 2019 …, 2019
202019
Computing the Fréchet distance between folded polygons
AF Cook IV, A Driemel, J Sherette, C Wenk
Computational Geometry 50, 1-16, 2015
182015
Systemet kan ikke foretage handlingen nu. Prøv igen senere.
Artikler 1–20