A Geometric Approach to Lower Bounds for Approximate Near-Neighbor Search and Partial Match

Authors:
Rina Panigrahy;Kunal Talwar;Udi Wieder
Affiliations:
-;-;-
Venue:
FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
Year:
2008

Similarity search and locality sensitive hashing using ternary content addressable memories

Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Lower bounds on performance of metric tree indexing schemes for exact similarity search in high dimensions

Proceedings of the Fourth International Conference on SImilarity Search and APplications
On noise-tolerant learning of sparse parities and related problems

ALT'11 Proceedings of the 22nd international conference on Algorithmic learning theory
NNS lower bounds via metric expansion for l

ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Optimal Lower Bounds for Locality-Sensitive Hashing (Except When q is Tiny)

ACM Transactions on Computation Theory (TOCT)

Hi-index	0.00

N/A