7133 search results - page 91 / 1427 » Communication algorithms with advice |
150
click to vote
ISVLSI
2003
IEEE
15 years 11 months ago
2003
IEEE
In this paper, we discuss the possibility of achieving onchip fault-tolerant communication based on a new communication paradigm called stochastic communication. Specifically, for...
165
click to vote
STOC
2007
ACM
16 years 6 months ago
2007
ACM
We introduce a new method to derive lower bounds on randomized and quantum communication complexity. Our method is based on factorization norms, a notion from Banach Space theory....
158
click to vote
IPPS
2006
IEEE
16 years 9 days ago
2006
IEEE
This paper demonstrates the one-sided communication used in languages like UPC can provide a significant performance advantage for bandwidth-limited applications. This is shown t...
168
click to vote
COST
1997
Springer
15 years 10 months ago
1997
Springer
: Automated processes in distributed communication environments require tools for unifying heterogeneous multimedia services. The Teleservice Descriptor is introduced for generic h...
191
click to vote
STOC
2009
ACM
16 years 6 months ago
2009
ACM
We consider the following question: given a two-argument boolean function f, represented as an N ? N binary matrix, how hard is to determine the (deterministic) communication comp...