lg n | Sciweavers

8

SODA
2004
ACM

104views Algorithms» more SODA 2004»

Tight bounds for the partial-sums problem

13 years 6 months ago

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...

Mihai Patrascu, Erik D. Demaine

claim paper

Read More »

13

click to vote

CCCG
2008

134views Computational Geometry» more CCCG 2008»

Achieving Spatial Adaptivity while Finding Approximate Nearest Neighbors

13 years 6 months ago

Download www.cs.cmu.edu

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...

Jonathan Derryberry, Don Sheehy, Maverick Woo, Dan...

claim paper

Read More »

13

click to vote

CATS
2007

84views Applied Computing» more CATS 2007»

On the Power of Structural Violations in Priority Queues

13 years 6 months ago

Download www.cphstl.dk

We give a priority queue that guarantees the worstcase cost of Θ(1) per minimum ﬁnding, insertion, and decrease; and the worst-case cost of Θ(lg n) with at most lg n + O( √ ...

Amr Elmasry, Claus Jensen, Jyrki Katajainen

claim paper

Read More »

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers