activity
20142020
most citedDartMinHash: Fast Sketching for Weighted Sets

6 citations · 12 across the 9 of their papers we have counts for

collaborators
Showing 2019Show all

2 papers · 1 filter

cs.DS2019★ 3 cited

PUFFINN: Parameterless and Universally Fast FInding of Nearest Neighbors

Martin Aumüller, Tobias Christiani, Rasmus Pagh +1

We present PUFFINN, a parameterless LSH-based index for solving the -nearest neighbor problem with probabilistic guarantees. By parameterless we mean that the user is only requi…

cs.DS2019

Algorithms for Similarity Search and Pseudorandomness

Tobias Christiani

We study the problem of approximate near neighbor (ANN) search and show the following results: - An improved framework for solving the ANN problem using locality-sensitive hashing,…