505 search results - page 13 / 101 » Optimal Error Correction for Computationally Bounded Noise |
FOCS
1991
IEEE
14 years 16 days 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...
DCC
2007
IEEE
14 years 8 months ago
2007
IEEE
We study the detection performance of large scale sensor networks, configured as trees with bounded height, in which information is progressively compressed as it moves towards th...
ESA
1999
Springer
14 years 1 months ago
1999
Springer
A critical step in all quartet methods for constructing evolutionary trees is the inference of the topology for each set of four sequences (i.e. quartet). It is a well–known fact...
CISS
2008
IEEE
14 years 3 months ago
2008
IEEE
— Reliable transmission is a challenging task over wireless links because wireless channels are susceptible to noise and interference. To address this problem various error contr...
FOCS
2005
IEEE
14 years 2 months ago
2005
IEEE
We prove the first non-trivial (super linear) lower bound in the noisy broadcast model, defined by El Gamal in [6]. In this model there are n + 1 processors P0, P1, . . . , Pn, ...