Sciweavers

106 search results - page 15 / 22
» Probabilistically Checkable Arguments
Sort
View
UAI
2004
13 years 10 months ago
A New Characterization of Probabilities in Bayesian Networks
We characterize probabilities in Bayesian networks in terms of algebraic expressions called quasi-probabilities. These are arrived at by casting Bayesian networks as noisy AND-OR-...
Lenhart K. Schubert
CDC
2009
IEEE
128views Control Systems» more  CDC 2009»
13 years 9 months ago
Feedback generation of quantum Fock states by discrete QND measures
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...
Mazyar Mirrahimi, Igor Dotsenko, Pierre Rouchon
RSA
2006
66views more  RSA 2006»
13 years 8 months ago
Regular graphs whose subgraphs tend to be acyclic
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...
Noga Alon, Eitan Bachmat
DCG
2000
76views more  DCG 2000»
13 years 8 months ago
A Central Limit Theorem for Convex Chains in the Square
Points P1, . . . , Pn in the unit square define a convex n-chain if they are below y = x and, together with P0 = (0, 0) and Pn+1 = (1, 1), they are in convex position. Under unifo...
Imre Bárány, Günter Rote, Willi...
SIAMDM
2000
69views more  SIAMDM 2000»
13 years 8 months ago
Bounds for Dispersers, Extractors, and Depth-Two Superconcentrators
We show that the size of the smallest depth-two N-superconcentrator is (N log2 N/ log log N). Before this work, optimal bounds were known for all depths except two. For the upper b...
Jaikumar Radhakrishnan, Amnon Ta-Shma