. Ecml,

A. Aggarwal, M. Hansen, and T. Leighton, Solving query-retrieval problems by compacting voronoi diagrams, Proceedings of the twenty-second annual ACM symposium on Theory of computing, pp.331-340, 1990.

J. Alman and R. Williams, Probabilistic polynomials and hamming nearest neighbors, Foundations of Computer Science (FOCS), 2015 IEEE 56th Annual Symposium on, pp.136-150, 2015.

H. Alt, B. Behrends, and J. Blömer, Approximate matching of polygonal shapes, Annals of Mathematics and Artiï¿¿cial Intelligence, vol.13, issue.3-4, pp.251-265, 1995.

H. Alt and M. Godau, Computing the fréchet distance between two polygonal curves, International Journal of Computational Geometry & Applications, vol.5, issue.01n02, pp.75-91, 1995.

A. Andoni and I. Razenshteyn, Optimal data-dependent hashing for approximate near neighbors, Proceedings of the forty-seventh annual ACM symposium on Theory of computing, pp.793-801, 2015.

S. Arya, D. M. Mount, A. Vigneron, and J. Xia, Space-time tradeoï¿¿s for proximity searching in doubling spaces, European Symposium on Algorithms, pp.112-123, 2008.

A. Backurs and A. Sidiropoulos, Constant-distortion embeddings of hausdorï¿¿ metrics into constant-dimensional l_p spaces, LIPIcs-Leibniz International Proceedings in Informatics, vol.60, 2016.

L. Bracciale, M. Bonola, P. Loreti, G. Bianchi, R. Amici et al., CRAWDAD dataset roma/taxi, 2014.

K. Bringmann, Why walking the dog takes time: Frechet distance has no strongly subquadratic algorithms unless seth fails, Foundations of Computer Science (FOCS), pp.661-670, 2014.

M. S. Charikar, Similarity estimation techniques from rounding algorithms, Proceedings of the thiry-fourth annual ACM symposium on Theory of computing, pp.380-388, 2002.

D. Douglas and T. Peucker, Algorithms for the reduction of the number of points required to represent a digitized line or its caricature. The Canadian Cartographer, vol.11, pp.112-122, 1973.

A. Driemel, A. Krivo?ija, and C. Sohler, Clustering time series under the fréachet distance, Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete algorithms, pp.766-785, 2016.

A. Driemel and F. Silvestri, Locality-Sensitive Hashing of Curves, 33rd International Symposium on Computational Geometry, vol.77, p.16, 2017.

A. Ghosh, B. Rozemberczki, S. Ramamoorthy, and R. Sarkar, Topological signatures for fast mobility analysis, 26th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems (ACM SIGSPATIAL, 2018.

A. Gionis, P. Indyk, and R. Motwani, Similarity search in high dimensions via hashing, VLDB, vol.99, pp.518-529, 1999.

P. Indyk, On approximate nearest neighbors under lâ?? norm, Journal of Computer and System Sciences, vol.63, issue.4, pp.627-638, 2001.

P. Indyk, Approximate nearest neighbor algorithms for fréchet distance via product metrics, Proceedings of the eighteenth annual symposium on Computational geometry, pp.102-106, 2002.

P. Indyk and R. Motwani, Approximate nearest neighbors: Towards removing the curse of dimensionality, Proc. 30th ACM Symposium on Theory of Computing (STOC), vol.8, pp.321-350, 1998.

P. Katsikouli, M. Astefanoaei, and R. Sarkar, Distributed mining of popular paths in road networks, DCOSS 2018-International Conference on Distributed Computing in Sensor Systems, pp.1-8, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01768273

P. Katsikouli, R. Sarkar, and J. Gao, Persistence based online signal and trajectory simpliï¿¿cation for mobile devices, Proceedings of the 22nd ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, pp.371-380, 2014.

J. Matousek, Reporting points in halfspaces, Computational Geometry, vol.2, issue.3, pp.169-186, 1992.

B. Mirzasoleiman, A. Karbasi, R. Sarkar, and A. Krause, Distributed submodular maximization, The Journal of Machine Learning Research, vol.17, issue.1, pp.8330-8373, 2016.

J. Niedermayer, A. Züï¿¿e, T. Emrich, M. Renz, N. Mamoulis et al., Probabilistic nearest neighbor queries on uncertain moving object trajectories, Proc. VLDB Endow, vol.7, pp.205-216, 2013.

R. Panigrahy, Entropy based nearest neighbor search in high dimensions, Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm, pp.1186-1195, 2006.

H. Sakoe and S. Chiba, Dynamic programming algorithm optimization for spoken word recognition. Acoustics, Speech and Signal Processing, IEEE Transactions on, vol.26, issue.1, pp.43-49, 1978.

D. Xie, F. Li, and J. M. Phillips, Distributed trajectory similarity search, Proceedings of the VLDB Endowment, vol.10, pp.1478-1489, 2017.

J. Zeng, G. Telang, M. P. Johnson, R. Sarkar, J. Gao et al., Mobile r-gather: Distributed and geographic clustering for location anonymity, Proceedings of the 18th ACM International Symposium on Mobile Ad Hoc Networking and Computing, 2017.