research
∙
06/14/2023
PLAN: Variance-Aware Private Mean Estimation
Differentially private mean estimation is an important building block in...
share
research
∙
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...
research
∙
07/06/2021
DEANN: Speeding up Kernel-Density Estimation using Approximate Nearest Neighbor Search
Kernel Density Estimation (KDE) is a nonparametric method for estimating...
research
∙
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...
research
∙
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...
research
∙
08/18/2020
Differentially Private Sketches for Jaccard Similarity Estimation
This paper describes two locally-differential private algorithms for rel...
research
∙
07/17/2019
The Role of Local Intrinsic Dimensionality in Benchmarking Nearest Neighbor Search
This paper reconsiders common benchmarking approaches to nearest neighbo...
research
∙
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...
research
∙
06/05/2019
Fair Near Neighbor Search: Independent Range Sampling in High Dimensions
Similarity search is a fundamental algorithmic primitive, widely used in...
research
∙
10/29/2018
Simple and Fast BlockQuicksort using Lomuto's Partitioning Scheme
This paper presents simple variants of the BlockQuicksort algorithm desc...
research
∙
07/15/2018
