10 citations · 11 across the 2 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2016
Fast Cross-Polytope Locality-Sensitive Hashing
Christopher Kennedy, Rachel Ward
We provide a variant of cross-polytope locality sensitive hashing with respect to angular distance which is provably optimal in asymptotic sensitivity and enjoys $\mathcal{O}(d \ln…
cs.DS2013★ 10 cited
Approximating the Little Grothendieck Problem over the Orthogonal and Unitary Groups
Afonso S. Bandeira, Christopher Kennedy, Amit Singer
The little Grothendieck problem consists of maximizing over binary variables , where C is a positive semidefinite matrix. In this paper we f…