118 search results - page 5 / 24 » Bounds on mutual information for simple codes using informat... |
ICANN
2005
Springer
13 years 11 months ago
2005
Springer
We describe a kernel method which uses the maximization of Onicescu’s informational energy as a criteria for computing the relevances of input features. This adaptive relevance d...
GLOBECOM
2009
IEEE
14 years 15 days ago
2009
IEEE
Abstract—Available network information is an important factor in determining network performance. In this paper, we study the basic limits on the amount of network information th...
ACTA
2011
13 years 21 days ago
2011
A simple mutual exclusion algorithm is presented that only uses nonatomic shared variables of bounded size, and that satisfies bounded overtaking. When the shared variables behave...
ICIP
2005
IEEE
14 years 7 months ago
2005
IEEE
A joint source channel coding scheme for error resilient image transmission is proposed. A practical image coder was introduced in [1] using modified Differential Pulse Coded Modu...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
Abstract-- We consider code division multiple access communication over a binary input additive white Gaussian noise channel using random spreading. For a general class of symmetri...