49 search results - page 4 / 10 » A tight lower bound for parity in noisy communication networ... |
JOC
2006
13 years 7 months ago
2006
We study the role of connectivity of communication networks in private computations under information theoretic settings. It will be shown that some functions can be computed by pr...
MOBIHOC
2012
ACM
11 years 9 months ago
2012
ACM
In this paper, we characterize the throughput of a broadcast network with n receivers using rateless codes with block size K. We assume that the underlying channel is a Markov mod...
GLOBECOM
2006
IEEE
14 years 1 months ago
2006
IEEE
— We consider a ring topology with limited or full switching capability as deployed in high bandwidth metro optical networks and develop a model to estimate the probability of bl...
ICC
2007
IEEE
14 years 1 months ago
2007
IEEE
In this paper we investigate the fault diagnosis problem in IP networks. We provide a lower bound on the average number of probes per edge using variational inference technique pro...
STOC
1996
ACM
13 years 11 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...