activity
20142020
most citedDartMinHash: Fast Sketching for Weighted Sets

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

collaborators
Showing 2016Show all

2 papers · 1 filter

cs.DS2016★ 3 cited

Set Similarity Search Beyond MinHash

Tobias Christiani, Rasmus Pagh

We consider the problem of approximate set similarity search under Braun-Blanquet similarity $B(\mathbf{x}, \mathbf{y}) = |\mathbf{x} \cap \mathbf{y}| / \max(|\mathbf{x}|, |\mathbf…

cs.DS2016

A Framework for Similarity Search with Space-Time Tradeoffs using Locality-Sensitive Filtering

Tobias Christiani

We present a framework for similarity search based on Locality-Sensitive Filtering (LSF), generalizing the Indyk-Motwani (STOC 1998) Locality-Sensitive Hashing (LSH) framework to s…