505 search results - page 2 / 101 » Message from General Co-Chairs |
CORR
2006
Springer
13 years 4 months ago
2006
Springer
Abstract-- Elaborating on prior work by Minka, we formulate a general computation rule for lossy messages. An important special case (with many applications in communications) is t...
CORR
2012
Springer
12 years 17 days ago
2012
Springer
Compiling Bayesian networks (BNs) to junction trees and performing belief propagation over them is among the most prominent approaches to computing posteriors in BNs. However, bel...
ICAC
2005
IEEE
13 years 10 months ago
2005
IEEE
Track 2 - Modeling and Abstraction of Services Process Session Chair: Dynamic Service Invocation Control in Service Composition Environments (SCC2010-2004) ...........................
CORR
2006
Springer
13 years 4 months ago
2006
Springer
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...
CCS
2009
ACM
14 years 5 months ago
2009
ACM
In this paper, we re-visit the problem of unconditionally secure message transmission (USMT) from a sender S to a receiver R, who are part of a distributed synchronous network, mo...