Sciweavers

2924 search results - page 20 / 585
» Lower Bounds in Distributed Computing
Sort
View
SPAA
1993
ACM
13 years 11 months ago
Asymptotically Tight Bounds for Performing BMMC Permutations on Parallel Disk Systems
d Abstract) Thomas H. Cormen Leonard F. Wisniewski Department of Mathematics and Computer Science Dartmouth College We give asymptotically equal lower and upper bounds for the num...
Thomas H. Cormen, Leonard F. Wisniewski
CORR
2008
Springer
65views Education» more  CORR 2008»
13 years 7 months ago
A Lower Bound on the Bayesian MSE Based on the Optimal Bias Function
A lower bound on the minimum mean-squared error (MSE) in a Bayesian estimation problem is proposed in this paper. This bound utilizes a well-known connection to the deterministic e...
Zvika Ben-Haim, Yonina C. Eldar
SPAA
2009
ACM
14 years 8 months ago
An optimal local approximation algorithm for max-min linear programs
In a max-min LP, the objective is to maximise subject to Ax 1, Cx 1, and x 0 for nonnegative matrices A and C. We present a local algorithm (constant-time distributed algorith...
Patrik Floréen, Joel Kaasinen, Petteri Kask...
ICPP
2009
IEEE
14 years 2 months ago
Performance Limits of Fair-Access in Underwater Sensor Networks
—This paper investigates fundamental performance limits of medium access control (MAC) protocols for particular underwater multi-hop sensor networks under a fair-access criterion...
Yang Xiao, Miao Peng, John H. Gibson, Geoffrey G. ...
PODC
1991
ACM
13 years 11 months ago
Resource Bounds for Self Stabilizing Message Driven Protocols
Abstract. Self-stabilizing message driven protocols are defined and discussed. The class weakexclusion that contains many natural tasks such as -exclusion and token-passing is de...
Shlomi Dolev, Amos Israeli, Shlomo Moran