Sciweavers

4255 search results - page 117 / 851
» Cover
Sort
View
CORR
2010
Springer
94views Education» more  CORR 2010»
15 years 4 months ago
Quantization of Discrete Probability Distributions
We study the problem of quantization of discrete probability distributions, arising in universal coding, as well as other applications. We show, that in many situations this probl...
Yuriy A. Reznik
CPHYSICS
2008
64views more  CPHYSICS 2008»
15 years 4 months ago
Multibondic cluster algorithm for finite-size scaling studies of critical phenomena
For finite-size scaling studies of second-order phase transitions the critical energy range of interest is usually larger than the energy range covered by a canonical Monte Carlo ...
Bernd A. Berg, Wolfhard Janke
CORR
2006
Springer
150views Education» more  CORR 2006»
15 years 4 months ago
An Achievability Result for the General Relay Channel
We consider the general relay channel. For this setup, the best achievability result was derived by Cover and ElGamal, in theorem 6 of their paper from 1979. In this work we apply...
Ron Dabora, Sergio D. Servetto
139
Voted
MST
2008
141views more  MST 2008»
15 years 4 months ago
From a Zoo to a Zoology: Towards a General Theory of Graph Polynomials
Abstract. We outline a general theory of graph polynomials which covers all the examples we found in the vast literature, in particular, the chromatic polynomial, various generaliz...
Johann A. Makowsky
IMCSIT
2010
15 years 2 months ago
Undetectable Spread-time Stegosystem Based on Noisy Channels
We consider a scenario where an attacker is able to receive a stegosignal only over a Gaussian channel. But in order to provide security of this channel noise
Valery I. Korzhik, Guillermo Morales-Luna, Ksenia ...