28888 search results - page 5350 / 5778 » Computability and complexity in analysis |
189
click to vote
CONCUR
2009
Springer
16 years 1 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...
213
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...
180
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...
195
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...
229
click to vote
KSEM
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Support Vector Machines (SVM) have been applied successfully in a wide variety of fields in the last decade. The SVM problem is formulated as a convex objective function...