388 search results - page 24 / 78 » Robust Lower Bounds for Communication and Stream Computation |
176
click to vote
ICC
2007
IEEE
16 years 10 days ago
2007
IEEE
— 1 In this paper, pilot-assisted transmission over Gauss-Markov Rayleigh fading channels is considered. A simple scenario, where a single pilot signal is transmitted every T sym...
185
click to vote
ECCC
2011
15 years 29 days ago
2011
We show two new direct product results in two different models of communication complexity. Our first result is in the model of one-way public-coin model. Let f ⊆ X × Y × Z ...
148
click to vote
PODC
2009
ACM
16 years 6 months ago
2009
ACM
We define and study the bandwidth determination problem in adhoc P2P environments. Using point-to-point bandwidth probes, the goal is to quickly determine each host's upload ...
166
click to vote
STOC
1996
ACM
15 years 10 months ago
1996
ACM
A linear array network consists of k + 1 processors P0; P1; : : : ; Pk with links only between Pi and Pi+1 0 i k. It is required to compute some boolean function f x; y in this n...
146
click to vote
IM
2006
15 years 6 months ago
2006
We consider the problem of computing information theoretic functions such as entropy on a data stream, using sublinear space. Our first result deals with a measure we call the &quo...