17541 search results - page 3274 / 3509 » Complexity in scalable computing |
180
click to vote
COCO
2009
Springer
15 years 11 months ago
2009
Springer
—A simple averaging argument shows that given a randomized algorithm A and a function f such that for every input x, Pr[A(x) = f(x)] ≥ 1−ρ (where the probability is over the...
148
Voted
CONCUR
2009
Springer
15 years 11 months ago
2009
Springer
Bisimulation equivalence is decidable in polynomial time for both sequential and commutative normed context-free processes, known as BPA and BPP, respectively. Despite apparent sim...
163
Voted
CRYPTO
2009
Springer
15 years 11 months ago
2009
Springer
We study the design of cryptographic primitives resilient to key-leakage attacks, where an attacker can repeatedly and adaptively learn information about the secret key, subject o...
140
click to vote
DCOSS
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. This paper presents a failure diagnosis algorithm for summarizing and generalizing patterns that lead to instances of anomalous behavior in sensor networks. Often multipl...
136
click to vote
GECCO
2009
Springer
15 years 11 months ago
2009
Springer
In this paper, we rigorously analyse how the magnitude and frequency of change may affect the performance of the algorithm (1+1) EAdyn on a set of artificially designed pseudo-Bo...