106
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
Abstract. In the first part of this article we introduce the notion of a backwardforward conditioning (BFC) system that generalises the notion of zero-class admissibiliy introduce...
59
Voted
CORR
2011
Springer
14 years 10 months ago
2011
Springer
99
Voted
CORR
2011
Springer
14 years 10 months ago
2011
Springer
124
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
A recent theorem of Bissacot, et al. proved using results about the cluster expansion in statistical mechanics extends the Lov´asz Local Lemma by weakening the conditions under w...
137
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
We introduce a graphical framework for Bayesian inference that is sufficiently general to accommodate not just the standard case but also recent proposals for a theory of quantum...
100
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
We cryptanalyse a matrix-based key transport protocol due to Baumslag, Camps, Fine, Rosenberger and Xu from 2006. We also cryptanalyse two recently proposed matrix-based key agree...
149
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
This paper considers the problem of matrix completion, when some number of the columns are arbitrarily corrupted, potentially by a malicious adversary. It is well-known that stand...
150
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
—We present a method to eliminate redundancy in the transition tables of Boolean automata: schema redescription with two symbols. One symbol is used to capture redundancy of indi...
155
Voted
CORR
2011
Springer
14 years 10 months ago
2011
Springer
Abstract. Notoriously, quantum computation shatters complexity theory, but is innocuous to computability theory [17]. Yet several works have shown how quantum theory as it stands c...