309 search results - page 62 / 62 » Communication Complexity Lower Bounds by Polynomials |
FOCS
2004
IEEE
13 years 11 months ago
2004
IEEE
The need to deal with massive data sets in many practical applications has led to a growing interest in computational models appropriate for large inputs. The most important quali...
COCO
2005
Springer
13 years 9 months ago
2005
Springer
We exhibit an explicitly computable ‘pseudorandom’ generator stretching l bits into m(l) = lΩ(log l) bits that look random to constant-depth circuits of size m(l) with log m...
AMAI
2008
Springer
13 years 7 months ago
2008
Springer
We study distributed boundary coverage of known environments using a team of miniature robots. Distributed boundary coverage is an instance of the multi-robot task-allocation prob...
TWC
2010
13 years 2 months ago
2010
Wideband source localization using acoustic sensor networks has been drawing a lot of research interest recently in wireless communication applications, such as cellular handset lo...