SODA
2004
ACM
14 years 24 days ago
2004
ACM
We close the gaps between known lower and upper bounds for the online partial-sums problem in the RAM and group models of computation. If elements are chosen from an abstract grou...
CCCG
2008
14 years 27 days ago
2008
We present the first spatially adaptive data structure that answers approximate nearest neighbor (ANN) queries to points that reside in a geometric space of any constant dimension...
CATS
2007
14 years 27 days ago
2007
We give a priority queue that guarantees the worstcase cost of Θ(1) per minimum finding, insertion, and decrease; and the worst-case cost of Θ(lg n) with at most lg n + O( √ ...