Sciweavers

CORR
2008
Springer
103views Education» more  CORR 2008»
14 years 19 days ago
Stabilizer Quantum Codes: A Unified View based on Forney-style Factor Graphs
Quantum error-correction codes (QECCs) are a vital ingredient of quantum computation and communication systems. In that context it is highly desirable to design QECCs that can be r...
Pascal O. Vontobel
CORR
2008
Springer
63views Education» more  CORR 2008»
14 years 19 days ago
A Public Key Block Cipher Based on Multivariate Quadratic Quasigroups
Abstract
Danilo Gligoroski, Smile Markovski, Svein J. Knaps...
CORR
2008
Springer
86views Education» more  CORR 2008»
14 years 19 days ago
A new characteristic property of rich words
Michelangelo Bucci, Alessandro De Luca, Amy Glen, ...
CORR
2008
Springer
81views Education» more  CORR 2008»
14 years 19 days ago
The Johnson-Lindenstrauss lemma almost characterizes Hilbert space, but not quite
Let X be a normed space that satisfies the Johnson-Lindenstrauss lemma (J-L lemma, in short) in the sense that for any integer n and any x1, . . . , xn X there exists a linear ma...
William B. Johnson, Assaf Naor
CORR
2008
Springer
127views Education» more  CORR 2008»
14 years 19 days ago
Theory of Rumour Spreading in Complex Social Networks
We introduce a general stochastic model for the spread of rumours, and derive mean-field equations that describe the dynamics of the model on complex social networks (in particula...
Maziar Nekovee, Yamir Moreno, G. Bianconi, M. Mars...
CORR
2008
Springer
92views Education» more  CORR 2008»
14 years 19 days ago
Catching Up Faster by Switching Sooner: A Prequential Solution to the AIC-BIC Dilemma
Bayesian model averaging, model selection and its approximations such as BIC are generally statistically consistent, but sometimes achieve slower rates of convergence than other m...
Tim van Erven, Peter Grünwald, Steven de Rooi...
CORR
2008
Springer
91views Education» more  CORR 2008»
14 years 19 days ago
Music, Complexity, Information
Damián H. Zanette
CORR
2008
Springer
110views Education» more  CORR 2008»
14 years 19 days ago
Finding Dense Subgraphs in G(n,1/2)
Finding the largest clique in random graphs is a well known hard problem. It is known that a random graph G(n, 1/2) almost surely has a clique of size about 2 log n. A simple greed...
Atish Das Sarma, Amit Deshpande, Ravi Kannan
CORR
2008
Springer
150views Education» more  CORR 2008»
14 years 19 days ago
Message-passing for Maximum Weight Independent Set
Abstract--In this paper, we investigate the use of messagepassing algorithms for the problem of finding the max-weight independent set (MWIS) in a graph. First, we study the perfor...
Sujay Sanghavi, Devavrat Shah, Alan S. Willsky