12 citations · 37 across the 10 of their papers we have counts for
Showing cs.LGShow all
3 papers · 1 filter
cs.LG2013
Markov Chain Monte Carlo for Arrangement of Hyperplanes in Locality-Sensitive Hashing
Yui Noma, Makiko Konoshima
Since Hamming distances can be calculated by bitwise computations, they can be calculated with less computational load than L2 distances. Similarity searches can therefore be perfo…
cs.LG2012★ 2 cited
Hyperplane Arrangements and Locality-Sensitive Hashing with Lift
Makiko Konoshima, Yui Noma
Locality-sensitive hashing converts high-dimensional feature vectors, such as image and speech, into bit arrays and allows high-speed similarity calculation with the Hamming distan…
cs.LG2012★ 3 cited
Locality-Sensitive Hashing with Margin Based Feature Selection
Makiko Konoshima, Yui Noma
We propose a learning method with feature selection for Locality-Sensitive Hashing. Locality-Sensitive Hashing converts feature vectors into bit arrays. These bit arrays can be use…