8 citations · 8 across the 3 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
cs.DS2016★ 8 cited
Approximate Furthest Neighbor with Application to Annulus Query
Rasmus Pagh, Francesco Silvestri, Johan Sivertsen +1
Much recent work has been devoted to approximate nearest neighbor queries. Motivated by applications in recommender systems, we consider approximate furthest neighbor (AFN) queries…
cs.DS2016
Distance Sensitive Bloom Filters Without False Negatives
Mayank Goswami, Rasmus Pagh, Francesco Silvestri +1
A Bloom filter is a widely used data-structure for representing a set and answering queries of the form "Is in ?". By allowing some false positive answers (saying "yes"…