133 search results - page 19 / 27 » Lower Bounds on the Randomized Communication Complexity of R... |
ICC
2007
IEEE
14 years 2 months ago
2007
IEEE
—Finding the distribution of the sum of lognormal We assume in this paper that the terms Yi are independent. The random variables is an important mathematical problem in probabil...
SODA
2010
ACM
14 years 6 months ago
2010
ACM
We settle the 1-pass space complexity of (1 ? )approximating the Lp norm, for real p with 1 p 2, of a length-n vector updated in a length-m stream with updates to its coordinate...
PODC
2005
ACM
14 years 2 months ago
2005
ACM
One of the fundamental problems in distributed computing is how to efficiently perform routing in a faulty network in which each link fails with some probability. This paper inves...
TCC
2010
Springer
14 years 5 months ago
2010
Springer
Goldreich-Krawczyk (Siam J of Comp’96) showed that only languages in BPP have constant-round public-coin black-box zero-knowledge protocols. We extend their lower bound to “ful...
CORR
2006
Springer
2006
Springer
Dense Gaussian Sensor Networks: Minimum Achievable Distortion and the Order Optimality of Separation
13 years 8 months ago
We investigate the optimal performance of dense sensor networks by studying the joint source-channel coding problem. The overall goal of the sensor network is to take measurements...