research
∙
05/23/2020
DartMinHash: Fast Sketching for Weighted Sets
Weighted minwise hashing is a standard dimensionality reduction techniqu...
share
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/22/2019
Algorithms for Similarity Search and Pseudorandomness
We study the problem of approximate near neighbor (ANN) search and show ...
research
∙
12/06/2018
Confirmation Sampling for Exact Nearest Neighbor Search
Locality-sensitive hashing (LSH), introduced by Indyk and Motwani in STO...
research
∙
12/04/2018
Optimal Boolean Locality-Sensitive Hashing
For 0 ≤β < α < 1 the distribution H over Boolean functions h {-1, 1}^d →...
research
∙
07/21/2017