138 search results - page 21 / 28 » Bit-probe lower bounds for succinct data structures |
VLDB
1997
ACM
14 years 2 days 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...
FOCS
2006
IEEE
14 years 2 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...
COMPGEOM
2006
ACM
14 years 1 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...
MONET
2007
13 years 7 months ago
2007
— This paper proposes a service discovery protocol for sensor networks that is specifically tailored for use in humancentered pervasive environments. It uses the high-level conc...
WADS
2007
Springer
14 years 2 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...