CORR
2008
Springer
14 years 16 days ago
2008
Springer
A solution to a problem of Erdos, Rubin and Taylor is obtained by showing that if a graph G is (a : b)-choosable, and c/d > a/b, then G is not necessarily (c : d)-choosable. Th...
CORR
2008
Springer
14 years 16 days ago
2008
Springer
We consider communication over a family of binary-input memoryless output-symmetric channels using lowdensity parity-check codes under message passing decoding. The asymptotic (in ...
CORR
2008
Springer
14 years 16 days ago
2008
Springer
CORR
2008
Springer
14 years 16 days ago
2008
Springer
The concept of universal designated verifier signatures was introduced by Steinfeld, Bull, Wang and Pieprzyk at Asiacrypt 2003. These signatures can be used as standard publicly ve...
CORR
2008
Springer
14 years 16 days ago
2008
Springer
: Given R groups of numerical variables X1, ... XR, we assume that each group is the result of one underlying latent variable, and that all latent variables are bound together thro...
CORR
2008
Springer
14 years 16 days ago
2008
Springer
A belief-propagation decoder for low-density lattice codes, which represents messages explicitly as a mixture of Gaussians functions, is given. In order to prevent the mixture elem...
CORR
2008
Springer
14 years 16 days ago
2008
Springer
Energy consumption is the most important factor that determines sensor node lifetime. The optimization of wireless sensor network lifetime targets not only the reduction of energy...
CORR
2008
Springer
14 years 16 days ago
2008
Springer
We analyze the role that popularity and novelty play in attracting the attention of users to dynamic websites. We do so by determining the performance of three different strategie...
CORR
2008
Springer
14 years 16 days ago
2008
Springer
In wireless channels, the path loss exponent (PLE) has a strong impact on the quality of the links, and hence, it needs to be accurately estimated for the efficient design and oper...
CORR
2008
Springer
14 years 16 days ago
2008
Springer
Random coding arguments are the backbone of most channel capacity achievability proofs. In this paper, we show that in their standard form, such arguments are insufficient for pro...