2924 search results - page 27 / 585 » Lower Bounds in Distributed Computing |
171
click to vote
FOCS
1991
IEEE
15 years 9 months ago
1991
IEEE
We prove that the reliable computation of any Boolean function with sensitivity s requires Ω(s log s) gates if the gates of the circuit fail independently with a fixed positive...
139
click to vote
ALT
2008
Springer
16 years 2 months ago
2008
Springer
Abstract. We give a lower bound for the error of any unitarily invariant algorithm learning half-spaces against the uniform or related distributions on the unit sphere. The bound i...
168
click to vote
FOCS
2006
IEEE
15 years 12 months ago
2006
IEEE
We convert cell-probe lower bounds for polynomial space into stronger lower bounds for near-linear space. Our technique applies to any lower bound proved through the richness meth...
170
click to vote
TSP
2010
15 years 17 days ago
2010
We compute lower bounds on the mean-square error of multiple change-point estimation. In this context, the parameters are discrete and the Cram