124 citations · 218 across the 3 of their papers we have counts for
3 papers
stat.ML2014★ 124 cited
Circulant Binary Embedding
Felix X. Yu, Sanjiv Kumar, Yunchao Gong +1
Binary embedding of high-dimensional data requires long codes to preserve the discriminative power of the input space. Traditional binary coding methods often suffer from very high…
cs.LG2012★ 35 cited
On the Difficulty of Nearest Neighbor Search
Junfeng He, Sanjiv Kumar, Shih-Fu Chang
Fast approximate nearest neighbor (NN) search in large databases is becoming popular. Several powerful learning-based formulations have been proposed recently. However, not much at…
cs.LG2012★ 59 cited
Compact Hyperplane Hashing with Bilinear Functions
Wei Liu, Jun Wang, Yadong Mu +2
Hyperplane hashing aims at rapidly searching nearest points to a hyperplane, and has shown practical impact in scaling up active learning with SVMs. Unfortunately, the existing ran…