Sciweavers

1132 search results - page 87 / 227
» Upper and lower Ramsey bounds in bounded arithmetic
Sort
View
COCOON
2008
Springer
15 years 8 months ago
Multi-party Quantum Communication Complexity with Routed Messages
This paper describes a general quantum lower bounding technique for the communication complexity of a function that depends on the inputs given to two parties connected via paths,...
Seiichiro Tani, Masaki Nakanishi, Shigeru Yamashit...
CORR
2008
Springer
100views Education» more  CORR 2008»
15 years 6 months ago
Lossy Source Transmission over the Relay Channel
Lossy transmission over a relay channel in which the relay has access to correlated side information is considered. First, a joint source-channel decode-and-forward scheme is propo...
Deniz Gündüz, Elza Erkip, Andrea J. Gold...
AUTOMATICA
2004
147views more  AUTOMATICA 2004»
15 years 6 months ago
Interval analysis and dioid: application to robust controller design for timed event graphs
This paper deals with feedback controller synthesis for timed event graphs in dioids, where the number of initial tokens and time delays are only known to belong to intervals. We ...
Mehdi Lhommeau, Laurent Hardouin, Bertrand Cottenc...
JAIR
2011
114views more  JAIR 2011»
14 years 9 months ago
Properties of Bethe Free Energies and Message Passing in Gaussian Models
We address the problem of computing approximate marginals in Gaussian probabilistic models by using mean field and fractional Bethe approximations. We define the Gaussian fracti...
Botond Cseke, Tom Heskes
PODC
2009
ACM
16 years 7 months ago
Tight bounds for clock synchronization
d Abstract] Christoph Lenzen Computer Engineering and Networks Laboratory (TIK) ETH Zurich, 8092 Zurich, Switzerland lenzen@tik.ee.ethz.ch Thomas Locher Computer Engineering and N...
Christoph Lenzen, Thomas Locher, Roger Wattenhofer