33 search results - page 5 / 7 » Probabilistic Argumentation Systems and Abduction |
SODA
2010
ACM
13 years 6 months ago
2010
ACM
We present an exact algorithm that decides, for every fixed r ≥ 2 in time O(m) + 2O(k2 ) whether a given multiset of m clauses of size r admits a truth assignment that satisfi...
CDC
2009
IEEE
13 years 9 months ago
2009
IEEE
A feedback scheme for preparation of photon number states in a microwave cavity is proposed. Quantum Non Demolition (QND) measurement of the cavity field provides information on it...
RSA
2006
13 years 7 months ago
2006
Motivated by a problem that arises in the study of mirrored storage systems, we describe, for any fixed , > 0 and any integer d 2, explicit or randomized constructions of d-r...
CSFW
2006
IEEE
14 years 1 months ago
2006
IEEE
We develop a compositional method for proving cryptographically sound security properties of key exchange protocols, based on a symbolic logic that is interpreted over conventiona...
STOC
2004
ACM
14 years 8 months ago
2004
ACM
The main result of this paper is a near-optimal derandomization of the affine homomorphism test of Blum, Luby and Rubinfeld (Journal of Computer and System Sciences, 1993). We sho...