We present a framework based on Locality-Sensitive Filtering (LSF) and apply it to show lower bounds and give improved upper bounds for the space-time tradeoff of solutions to the (r, cr)-nearâ€¦ (More)

We consider the problem of approximate set similarity search under Braun-Blanquet similarity <i>B</i>(<i>x</i>, <i>y</i>) = |<i>x</i> âÂˆ© <i>y</i>| / max(|<i>x</i>|, |<i>y</i>|). Theâ€¦ (More)

We consider the following fundamental problems: Constructing k-independent hash functions with a space-time tradeoff close to Siegel's lower bound. Constructing representations of unbalanced expanderâ€¦ (More)

2014 IEEE 55th Annual Symposium on Foundations ofâ€¦

2014

The generation of pseudorandom elements over finite fields is fundamental to the time, space and randomness complexity of randomized algorithms and data structures. We consider the problem ofâ€¦ (More)

Set similarity join is a fundamental and wellstudied database operator. It is usually studied in the exact setting where the goal is to compute all pairs of sets that exceed a given similarityâ€¦ (More)

We initiate the study of distance-sensitive hashing, a generalization of locality-sensitive hashing that seeks a family of hash functions such that the probability of two points having the same hashâ€¦ (More)

The Indyk-Motwani Locality-Sensitive Hashing (LSH) framework (STOC 1998) is a general technique for constructing a data structure to answer approximate near neighbor queries by using a distribution Hâ€¦ (More)