7 citations · 9 across the 8 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
cs.DS2017
Lattice-based Locality Sensitive Hashing is Optimal
Karthekeyan Chandrasekaran, Daniel Dadush, Venkata Gandikota +1
Locality sensitive hashing (LSH) was introduced by Indyk and Motwani (STOC `98) to give the first sublinear time algorithm for the c-approximate nearest neighbor (ANN) problem usin…
cs.IT2017
Nearly Optimal Sparse Group Testing
Venkata Gandikota, Elena Grigorescu, Sidharth Jaggi +1
Group testing is the process of pooling arbitrary subsets from a set of items so as to identify, with a minimal number of tests, a "small" subset of defective items. In "cl…