Articles avec mandats d'accès public - Martin AumüllerEn savoir plus
Non disponibles : 2
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
Exigences : German Research Foundation
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
Exigences : Innovation Fund Denmark
Disponibles quelque part : 17
ANN-Benchmarks: A benchmarking tool for approximate nearest neighbor algorithms
M Aumüller, E Bernhardsson, A Faithfull
Information Systems 87, 101374, 2020
Exigences : European Commission
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
Exigences : European Commission
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
Exigences : German Research Foundation
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
Exigences : European Commission
The role of local dimensionality measures in benchmarking nearest neighbor search
M Aumüller, M Ceccarello
Information Systems 101, 101807, 2021
Exigences : European Commission
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
Exigences : Villum Foundation, European Commission
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
Exigences : Villum Foundation, Government of Italy
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
Exigences : US National Science Foundation, Villum Foundation, Government of Italy
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
Exigences : Villum Foundation
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
Exigences : US National Science Foundation, Government of Italy
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
Exigences : Austrian Science Fund, National Research Foundation, South Africa
Implementing distributed similarity joins using locality sensitive hashing
M Aumüller, M Ceccarello
Proceedings of the 25th International Conference on Extending Technology …, 2022
Exigences : European Commission
Sampling near neighbors in search for fairness
M Aumüller, S Har-Peled, S Mahabadi, R Pagh, F Silvestri
Communications of the ACM 65 (8), 83-90, 2022
Exigences : US National Science Foundation, Villum Foundation, Government of Italy
Reproducibility companion paper: visual sentiment analysis for review images with item-oriented and user-oriented CNN
QT Truong, HW Lauw, M Aumüller, N Nitta
Proceedings of the 28th ACM International Conference on Multimedia, 4444-4447, 2020
Exigences : National Research Foundation, Singapore
Suitability of Nearest Neighbour Indexes for Multimedia Relevance Feedback
OS Khan, M Aumüller, BÞ Jónsson
International Conference on Similarity Search and Applications, 133-147, 2023
Exigences : Icelandic Centre for Research, Innovation Fund Denmark
The magazine archive includes every article published in Communications of the ACM for over the past 50 years.
F Restuccia, T Melodia
Communications of the ACM 65 (9), 83-91, 2022
Exigences : US Department of Defense
Sampling a Near Neighbor in High Dimensions
M AUMÜLLER, S HAR-PELED, R PAGH, F SILVESTRI
Exigences : US National Science Foundation, Government of Italy
Les informations concernant la publication et le financement sont déterminées automatiquement par un programme informatique