19 citations · 23 across the 4 of their papers we have counts for
Showing cs.CGShow all
2 papers · 1 filter
cs.CG2011★ 1 cited
Approximate Bregman near neighbors in sublinear time: Beyond the triangle inequality
Amirali Abdullah, John Moeller, Suresh Venkatasubramanian
In this paper we present the first provable approximate nearest-neighbor (ANN) algorithms for Bregman divergences. Our first algorithm processes queries in O(log^d n) time using O(…
cs.CG2009★ 2 cited
Computing Hulls And Centerpoints In Positive Definite Space
P. Thomas Fletcher, John Moeller, Jeff M. Phillips +1
In this paper, we present algorithms for computing approximate hulls and centerpoints for collections of matrices in positive definite space. There are many applications where the…