138 search results - page 11 / 28 » Lower Bounds for Succinct Data Structures |
146
Voted
COMPGEOM
2008
ACM
15 years 5 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, ...
137
click to vote
ECCC
2010
15 years 3 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...
168
click to vote
PODS
1995
ACM
15 years 7 months ago
1995
ACM
During the last decade various spatial data structures have been designed and compared against each other with respect to their performance. Still missing is a lower bound result,...
132
click to vote
COMPGEOM
2009
ACM
15 years 10 months ago
2009
ACM
We consider a number of range reporting problems in two and three dimensions and prove lower bounds on the amount of space used by any cache-oblivious data structure for these pro...
139
Voted
ICDE
2006
IEEE
15 years 9 months ago
2006
IEEE
Widespread interest in time-series similarity search has made more in need of efficient technique, which can reduce dimensionality of the data and then to index it easily using a ...