254 search results - page 18 / 51 » On randomized one-round communication complexity |
AICT
2008
IEEE
13 years 7 months ago
2008
IEEE
This paper presents the simplified method of random test suite based on the frequency (block) test. The test is used to check the first property of random numbers which is to have ...
INFOCOM
2010
IEEE
13 years 6 months ago
2010
IEEE
— Random access protocols, such as Aloha, are commonly modeled in wireless ad-hoc networks by using the protocol model. However, it is well-known that the protocol model is not a...
VTC
2010
IEEE
13 years 6 months ago
2010
IEEE
—In wireless sensor networks (WSN), stochastic node dropping and unpredictable node failure greatly impair coverage, creating sensing holes, while locally redundant sensors exist...
INFOCOM
2011
IEEE
12 years 11 months ago
2011
IEEE
Abstract—Market-based mechanisms offer promising approaches for spectrum access in cognitive radio networks. In this paper, we focus on two market models, one with a monopoly pri...
COCO
2009
Springer
14 years 2 months ago
2009
Springer
—A simple averaging argument shows that given a randomized algorithm A and a function f such that for every input x, Pr[A(x) = f(x)] ≥ 1−ρ (where the probability is over the...