565 citations · 4k across the 52 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
cs.LG2013★ 57 cited
The Power of Asymmetry in Binary Hashing
Behnam Neyshabur, Payman Yadollahpour, Yury Makarychev +2
When approximating binary similarity using the hamming distance between short binary hashes, we show that even if the similarity is symmetric, we can have shorter and more accurate…
cs.LG2013★ 20 cited
Sparse Matrix Factorization
Behnam Neyshabur, Rina Panigrahy
We investigate the problem of factorizing a matrix into several sparse matrices and propose an algorithm for this under randomness and sparsity assumptions. This problem can be vie…