198 search results - page 7 / 40 » Evidence-invariant Sensitivity Bounds |
FOCS
1991
IEEE
13 years 11 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...
AMAI
2004
Springer
14 years 1 months ago
2004
Springer
The majority of the work in the area of Markov decision processes has focused on expected values of rewards in the objective function and expected costs in the constraints. Althou...
DCOSS
2006
Springer
13 years 11 months ago
2006
Springer
In a sensor network information from multiple nodes must usually be aggregated in order to accomplish a certain task. A natural way to view this information gathering is in terms o...
INFOCOM
2009
IEEE
14 years 2 months ago
2009
IEEE
—MAC layer random network coding (MRNC) was proposed in [1] as an alternative to HARQ for reliable data transmission in WiMAX unicast. It has been shown that MRNC achieves a high...
SDM
2010
SIAM
13 years 9 months ago
2010
SIAM
A highly skewed microdata contains some sensitive attribute values that occur far more frequently than others. Such data violates the "eligibility condition" assumed by ...