138 search results - page 12 / 28 » Bit-probe lower bounds for succinct data structures |
VRCAI
2006
ACM
14 years 1 months ago
2006
ACM
We present novel algorithms for updating bounding volume hierarchies of objects undergoing arbitrary deformations. Therefore, we introduce two new data structures, the kinetic AAB...
ESA
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. In this paper we study the external memory planar point enclosure problem: Given N axis-parallel rectangles in the plane, construct a data structure on disk (an index) su...
COMPGEOM
2008
ACM
13 years 9 months ago
2008
ACM
We study the problem of two-dimensional Delaunay triangulation in the self-improving algorithms model [1]. We assume that the n points of the input each come from an independent, ...
ECCC
2011
13 years 2 months ago
2011
Locally decodable codes are error correcting codes with the extra property that, in order to retrieve the correct value of just one position of the input with high probability, it...
ECCC
2010
13 years 8 months ago
2010
We study a variant of the classical circuit-lower-bound problems: proving lower bounds for sampling distributions given random bits. We prove a lower bound of 1 - 1/n(1) on the st...