16666 search results - page 3094 / 3334 » Descriptive and Computational Complexity |
202
click to vote
CRYPTO
2009
Springer
16 years 1 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...
171
click to vote
DCOSS
2009
Springer
16 years 1 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...
176
click to vote
GECCO
2009
Springer
16 years 1 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...
182
click to vote
ISEUD
2009
Springer
16 years 1 months ago
2009
Springer
All software today is written using libraries, toolkits, frameworks and other application programming interfaces (APIs). We performed a user study of the online documentation a lar...
148
click to vote
IWPEC
2009
Springer
16 years 1 months ago
2009
Springer
An induced matching in graph G is a matching which is an induced subgraph of G. Clearly, among two vertices with the same neighborhood (called twins) at most one is matched in any...