Suivre
Martin Aumüller
Titre
Citée par
Citée par
Année
ANN-Benchmarks: A benchmarking tool for approximate nearest neighbor algorithms
M Aumüller, E Bernhardsson, A Faithfull
Information Systems 87, 101374, 2020
3142020
Ann-benchmarks: A benchmarking tool for approximate nearest neighbor algorithms
M Aumüller, E Bernhardsson, A Faithfull
International conference on similarity search and applications, 34-49, 2017
1402017
Results of the NeurIPS'21 Challenge on Billion-Scale Approximate Nearest Neighbor Search
H Vardhan Simhadri, G Williams, M Aumüller, M Douze, A Babenko, ...
NeurIPS 2021 Competitions and Demonstrations Track, arXiv: 2205.03763, 2022
62*2022
Explicit and efficient hash families suffice for cuckoo hashing with a stash
M Aumüller, M Dietzfelbinger, P Woelfel
Algorithmica 70 (3), 428-456, 2014
532014
Parameter-free locality sensitive hashing for spherical range reporting
TD Ahle, M Aumüller, R Pagh
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017
522017
Optimal partitioning for dual-pivot quicksort
M Aumüller, M Dietzfelbinger
ACM Transactions on Algorithms (TALG) 12 (2), 1-36, 2015
482015
The role of local dimensionality measures in benchmarking nearest neighbor search
M Aumüller, M Ceccarello
Information Systems 101, 101807, 2021
38*2021
PUFFINN: parameterless and universally fast finding of nearest neighbors
M Aumüller, T Christiani, R Pagh, M Vesterli
arXiv preprint arXiv:1906.12211, 2019
342019
Distance-sensitive hashing
M Aumüller, T Christiani, R Pagh, F Silvestri
Proceedings of the 37th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of …, 2018
332018
How good is multi-pivot quicksort?
M Aumüller, M Dietzfelbinger, P Klaue
ACM Transactions on Algorithms (TALG) 13 (1), 1-47, 2016
262016
Fair near neighbor search: Independent range sampling in high dimensions
M Aumüller, R Pagh, F Silvestri
Proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of …, 2020
232020
Fair near neighbor search via sampling
M Aumuller, S Har-Peled, S Mahabadi, R Pagh, F Silvestri
ACM SIGMOD Record 50 (1), 42-49, 2021
222021
Overview of the SISAP 2024 Indexing Challenge
ES Tellez, M Aumüller, V Mic
International Conference on Similarity Search and Applications, 255-265, 2024
162024
Representing sparse vectors with differential privacy, low error, optimal space, and fast access
M Aumüller, CJ Lebeda, R Pagh
Journal of Privacy and Confidentiality 12 (2), 2022
16*2022
Experimental variations of a theoretically good retrieval data structure
M Aumüller, M Dietzfelbinger, M Rink
Algorithms-ESA 2009: 17th Annual European Symposium, Copenhagen, Denmark …, 2009
162009
Sampling a Near Neighbor in High Dimensions—Who is the Fairest of Them All?
M Aumüller, S Har-Peled, S Mahabadi, R Pagh, F Silvestri
ACM Transactions on Database Systems (TODS) 47 (1), 1-40, 2022
142022
Recent Approaches and Trends in Approximate Nearest Neighbor Search, with Remarks on Benchmarking
M Aumüller, M Ceccarello
Bulletin of the Technical Committee on Data Engineering 47 (3), 89-105, 2023
132023
Deann: Speeding up kernel-density estimation using approximate nearest neighbor search
M Karppa, M Aumüller, R Pagh
International Conference on Artificial Intelligence and Statistics, 3108-3137, 2022
122022
Differentially private sketches for Jaccard similarity estimation
M Aumüller, A Bourgeat, J Schmurr
Similarity Search and Applications: 13th International Conference, SISAP …, 2020
112020
Dual-pivot quicksort: Optimality, analysis and zeros of associated lattice paths
M Aumüller, M Dietzfelbinger, C Heuberger, D Krenn, H Prodinger
Combinatorics, Probability and Computing 28 (4), 485-518, 2019
10*2019
Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.
Articles 1–20