524 search results - page 50 / 105 » An Optimal Lower Bound on the Communication Complexity of Ga... |
INFOCOM
2012
IEEE
11 years 10 months ago
2012
IEEE
Abstract—We aim to enhance the end-to-end rate of a general dual-hop relay network with multiple channels and finite modulation formats, by jointly optimizing channel pairing, p...
INFOCOM
2009
IEEE
14 years 2 months ago
2009
IEEE
Abstract—We study the joint power control and minimumframe-length scheduling problem in wireless networks, under the physical interference model and subject to consecutive transm...
INFOCOM
2009
IEEE
14 years 2 months ago
2009
IEEE
—We consider the question of obtaining tight delay guarantees for throughout-optimal link scheduling in arbitrary topology wireless ad-hoc networks. We consider two classes of sc...
FOCS
2009
IEEE
14 years 2 months ago
2009
IEEE
Abstract— Thorup and Zwick, in their seminal work, introduced the approximate distance oracle, which is a data structure that answers distance queries in a graph. For any integer...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Motivated by random linear network coding, we study the communication through channels, called linear operator channels (LOCs), that perform linear operation over finite fields. Fo...