5356 search results - page 979 / 1072 » Adventures in time and space |
109
click to vote
STOC
2003
ACM
16 years 1 months ago
2003
ACM
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
116
click to vote
OSDI
2002
ACM
16 years 1 months ago
2002
ACM
Many system errors do not emerge unless some intricate sequence of events occurs. In practice, this means that most systems have errors that only trigger after days or weeks of ex...
ICALP
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We consider the succinct representation of ordinal and cardinal trees on the RAM with logarithmic word size. Given a tree T, our representations support the following ope...
205
click to vote
VLDB
2007
ACM
16 years 1 months ago
2007
ACM
Given a set of model graphs D and a query graph q, containment search aims to find all model graphs g D such that q contains g (q g). Due to the wide adoption of graph models, f...
170
click to vote
SIGMOD
2008
ACM
16 years 1 months ago
2008
ACM
Motivated by the fact that XML is increasingly being used in distributed applications, we propose building a cooperative caching scheme for XML documents. Our scheme allows sharin...