138 search results - page 20 / 28 » Lower Bounds for Succinct Data Structures |
128
Voted
VLDB
1997
ACM
15 years 7 months ago
1997
ACM
Query optimizers that explore a search space exhaustively using transformation rules usually apply all possible rules on each alternative, and stop when no new information is prod...
118
Voted
FOCS
2006
IEEE
15 years 9 months ago
2006
IEEE
We investigate the optimality of (1+ )-approximation algorithms obtained via the dimensionality reduction method. We show that: • Any data structure for the (1 + )-approximate n...
123
Voted
COMPGEOM
2006
ACM
15 years 9 months ago
2006
ACM
We investigate a new class of geometric problems based on the idea of online error correction. Suppose one is given access to a large geometric dataset though a query mechanism; f...
133
Voted
IPL
2002
15 years 3 months ago
2002
Restricted rotation distance between pairs of rooted binary trees measures differences in tree shape and is related to rotation distance. In restricted rotation distance, the rota...
119
Voted
WADS
2007
Springer
15 years 9 months ago
2007
Springer
In the faulty-memory RAM model, the content of memory cells can get corrupted at any time during the execution of an algorithm, and a constant number of uncorruptible registers are...