Sciweavers

732 search results - page 111 / 147
» corr 2011
Sort
View
95
Voted
CORR
2011
Springer
168views Education» more  CORR 2011»
14 years 5 months ago
Precoding for Outage Probability Minimization on Block Fading Channels
The outage probability limit is a fundamental and achievable lower bound on the word error rate of coded communication systems affected by fading. This limit is mainly determined ...
Dieter Duyck, Joseph Jean Boutros, Marc Moeneclaey
104
Voted
CORR
2011
Springer
243views Education» more  CORR 2011»
14 years 5 months ago
Localization from Incomplete Noisy Distance Measurements
—We consider the problem of positioning a cloud of points in the Euclidean space Rd , from noisy measurements of a subset of pairwise distances. This task has applications in var...
Adel Javanmard, Andrea Montanari
CORR
2011
Springer
153views Education» more  CORR 2011»
14 years 5 months ago
Proof-Theoretic Soundness and Completeness
We give a calculus for reasoning about the first-order fragment of classical logic that is adequate for giving the truth conditions of intuitionistic Kripke frames, and outline a...
Robert Rothenberg
CORR
2011
Springer
155views Education» more  CORR 2011»
14 years 5 months ago
Subexponential convergence for information aggregation on regular trees
— We consider the decentralized binary hypothesis testing problem on trees of bounded degree and increasing depth. For a regular tree of depth t and branching factor k ≥ 2, we ...
Yashodhan Kanoria, Andrea Montanari
CORR
2011
Springer
149views Education» more  CORR 2011»
14 years 5 months ago
General Iteration graphs and Boolean automata circuits
This article is set in the eld of regulation networks modeled by discrete dynamical systems. It focuses on Boolean automata networks. In such networks, there are many ways to upd...
Mathilde Noual