7820 search results - page 1240 / 1564 » Formalization of Time and Space |
169
click to vote
STOC
2004
ACM
16 years 7 months ago
2004
ACM
We investigate the design of algorithms resilient to memory faults, i.e., algorithms that, despite the corruption of some memory values during their execution, are able to produce...
151
click to vote
STOC
2001
ACM
16 years 7 months ago
2001
ACM
In this paper we analyze the behavior of quantum random walks. In particular we present several new results for the absorption probabilities in systems with both one and two absor...
164
click to vote
OSDI
2002
ACM
16 years 7 months ago
2002
ACM
Current system loggers have two problems: they depend on the integrity of the operating system being logged, and they do not save sufficient information to replay and analyze atta...
175
click to vote
OSDI
2002
ACM
16 years 7 months ago
2002
ACM
It is becoming increasingly common to construct network services using redundant resources geographically distributed across the Internet. Content Distribution Networks are a prim...
289
click to vote
VLDB
2007
ACM
16 years 7 months ago
2007
ACM
We investigate the problem of how to evaluate efficiently a collection of shortest path queries on massive graphs that are too big to fit in the main memory. To evaluate a shortes...