6393 search results - page 1002 / 1279 » Randomized Algorithms on the Mesh |
137
Voted
INFOCOM
2003
IEEE
15 years 10 months ago
2003
IEEE
— Multiuser diversity refers to a type of diversity present across different users in a fading environment. This diversity can be exploited by scheduling transmissions so that us...
165
click to vote
DIALM
2003
ACM
15 years 10 months ago
2003
ACM
We study topology control problems in ad hoc networks, where network nodes get to choose their power levels in order to ensure desired connectivity properties. Unlike most other w...
144
click to vote
ADAEUROPE
2003
Springer
15 years 10 months ago
2003
Springer
ontainer. In particular, an iterator abstracts away differences in specific container types, allowing you to view the collection simply as a sequence of items. A generic algorith...
127
click to vote
COCO
2009
Springer
15 years 8 months ago
2009
Springer
Abstract--We study the 2-party randomized communication complexity of read-once AC0 formulae. For balanced AND-OR trees T with n inputs and depth d, we show that the communication ...
138
click to vote
APPROX
2010
Springer
15 years 6 months ago
2010
Springer
We initiate the study of multi-source extractors in the quantum world. In this setting, our goal is to extract random bits from two independent weak random sources, on which two q...