769 search results - page 56 / 154 » Where Is the Proof |
ASIACRYPT
2008
Springer
13 years 11 months ago
2008
Springer
Abstract. The generic (aka. black-box) group model is a valuable methodology for analyzing the computational hardness of number-theoretic problems used in cryptography. Since the p...
CCS
2008
ACM
13 years 10 months ago
2008
ACM
A recent development in formal security protocol analysis is the Protocol Composition Logic (PCL). We identify a number of problems with this logic as well as with extensions of t...
NIPS
2008
13 years 10 months ago
2008
This work characterizes the generalization ability of algorithms whose predictions are linear in the input vector. To this end, we provide sharp bounds for Rademacher and Gaussian...
ICWS
2004
IEEE
13 years 10 months ago
2004
IEEE
This paper introduces a method for automatic composition of Semantic Web services using Linear Logic (LL) theorem proving. The method uses Semantic Web service language (DAML-S) f...
ECAI
2010
Springer
13 years 9 months ago
2010
Springer
AI Planning is concerned with the selection of actions towards achieving a goal. Research on cellular automata (CA) is concerned with the question how global behaviours arise from ...