254 search results - page 45 / 51 » On randomized one-round communication complexity |
CISS
2007
IEEE
14 years 2 months ago
2007
IEEE
— We consider a sensor network in which the sensors communicate at will when they have something to report, without prior coordination with other sensors or with data collection ...
MOBICOM
2010
ACM
13 years 7 months ago
2010
ACM
Mobility traces of people and vehicles have been collected and published to assist the design and evaluation of mobile networks, such as large-scale urban sensing networks. Althou...
CORR
2010
Springer
13 years 2 months ago
2010
Springer
Random linear network codes can be designed and implemented in a distributed manner, with low computational complexity. However, these codes are classically implemented [1] over fi...
FOCS
2008
IEEE
14 years 2 months ago
2008
IEEE
Razborov and Rudich have shown that so-called natural proofs are not useful for separating P from NP unless hard pseudorandom number generators do not exist. This famous result is...
GLOBECOM
2007
IEEE
14 years 1 months ago
2007
IEEE
— A relay selection approach has previously been shown to outperform repetition-based scheduling for both amplify-and-forward (AF) and decode-and-forward (DF) cooperative network...