10602 search results - page 2003 / 2121 » Weakly Useful Sequences |
180
click to vote
OSDI
2002
ACM
16 years 6 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...
284
click to vote
VLDB
2005
ACM
16 years 6 months ago
2005
ACM
Abstract. In this paper we present new concurrent and recoverable B-link-tree algorithms. Unlike previous algorithms, ours maintain the balance of the B-link tree at all times, so ...
180
click to vote
PODS
2005
ACM
16 years 6 months ago
2005
ACM
Suppose we have a large table T of items i, each with a weight wi, e.g., people and their salary. In a general preprocessing step for estimating arbitrary subset sums, we assign e...
151
click to vote
ICSE
2005
IEEE-ACM
16 years 6 months ago
2005
IEEE-ACM
We argue that finding vulnerabilities in software components is different from finding exploits against them. Exploits that compromise security often use several low-level details...
160
click to vote
SODA
2010
ACM
16 years 3 months ago
2010
ACM
There has been great interest in deciding whether a combinatorial structure satisfies some property, or in estimating the value of some numerical function associated with this com...