33 citations · 81 across the 24 of their papers we have counts for
Showing cs.CGShow all
3 papers · 1 filter
cs.CG2017
LSH on the Hypercube Revisited
Sariel Har-Peled, Sepideh Mahabadi
LSH (locality sensitive hashing) had emerged as a powerful technique in nearest-neighbor search in high dimensions [IM98, HIM12]. Given a point set in a metric space, and given…
cs.CG2016
Approximate Sparse Linear Regression
Sariel Har-Peled, Piotr Indyk, Sepideh Mahabadi
In the Sparse Linear Regression (SLR) problem, given a matrix and a -dimensional query , the goal is to compute a -sparse -dimensional vector such…
cs.CG2015★ 1 cited
Proximity in the Age of Distraction: Robust Approximate Nearest Neighbor Search
Sariel Har-Peled, Sepideh Mahabadi
We introduce a new variant of the nearest neighbor search problem, which allows for some coordinates of the dataset to be arbitrarily corrupted or unknown. Formally, given a datase…