Martin Aumüller | DeepAI

AI Chat

Featured Co-authors

Jingdong Wang
123 publications
Qi Chen
65 publications
Sariel Har-Peled
44 publications
Matthijs Douze
38 publications
Rasmus Pagh
36 publications
Artem Babenko
32 publications
Sepideh Mahabadi
14 publications
Dmitry Baranchuk
10 publications
Francesco Silvestri
10 publications
Ravishankar Krishnaswamy
9 publications
Boel Nelson
7 publications

∙ 06/14/2023

PLAN: Variance-Aware Private Mean Estimation

Differentially private mean estimation is an important building block in...

0 Martin Aumüller, et al. ∙

∙ 05/08/2022

Results of the NeurIPS'21 Challenge on Billion-Scale Approximate Nearest Neighbor Search

Despite the broad range of algorithms for Approximate Nearest Neighbor S...

0 Harsha Vardhan Simhadri, et al. ∙

∙ 07/06/2021

DEANN: Speeding up Kernel-Density Estimation using Approximate Nearest Neighbor Search

Kernel Density Estimation (KDE) is a nonparametric method for estimating...

0 Matti Karppa, et al. ∙

∙ 06/18/2021

Differentially private sparse vectors with low error, optimal space, and fast access

Representing a sparse histogram, or more generally a sparse vector, is a...

0 Martin Aumüller, et al. ∙

∙ 01/26/2021

Sampling a Near Neighbor in High Dimensions – Who is the Fairest of Them All?

Similarity search is a fundamental algorithmic primitive, widely used in...

0 Martin Aumüller, et al. ∙

∙ 08/18/2020

Differentially Private Sketches for Jaccard Similarity Estimation

This paper describes two locally-differential private algorithms for rel...

0 Martin Aumüller, et al. ∙

∙ 07/17/2019

The Role of Local Intrinsic Dimensionality in Benchmarking Nearest Neighbor Search

This paper reconsiders common benchmarking approaches to nearest neighbo...

0 Martin Aumüller, et al. ∙

∙ 06/28/2019

PUFFINN: Parameterless and Universally Fast FInding of Nearest Neighbors

We present PUFFINN, a parameterless LSH-based index for solving the k-ne...

0 Martin Aumüller, et al. ∙

∙ 06/05/2019

Fair Near Neighbor Search: Independent Range Sampling in High Dimensions

Similarity search is a fundamental algorithmic primitive, widely used in...

0 Martin Aumüller, et al. ∙

∙ 10/29/2018

Simple and Fast BlockQuicksort using Lomuto's Partitioning Scheme

This paper presents simple variants of the BlockQuicksort algorithm desc...

0 Martin Aumüller, et al. ∙

∙ 07/15/2018

ANN-Benchmarks: A Benchmarking Tool for Approximate Nearest Neighbor Algorithms

This paper describes ANN-Benchmarks, a tool for evaluating the performan...

0 Martin Aumüller, et al. ∙

Are you a researcher?
Expose your work
to one of the largest
A.I. communities in the world