501 search results - page 69 / 101 » Communication Lower Bounds Using Dual Polynomials |
85
Voted
ADHOCNOW
2010
Springer
14 years 11 months ago
2010
Springer
We consider the problem of efficient alarm protocol for ad-hoc radio networks consisting of devices that try to gain access for transmission through a shared radio communication ch...
78
Voted
JOC
2006
14 years 10 months ago
2006
We study the role of connectivity of communication networks in private computations under information theoretic settings. It will be shown that some functions can be computed by pr...
94
Voted
ESA
2008
Springer
15 years 20 hour ago
2008
Springer
We consider two generalizations of the edge coloring problem in bipartite graphs. The first problem we consider is the weighted bipartite edge coloring problem where we are given a...
101
Voted
INFOCOM
2010
IEEE
14 years 8 months ago
2010
IEEE
We investigate the price of anarchy of a load balancing game with K dispatchers. The service rates and holding costs are assumed to depend on the server, and the service disciplin...
CORR
2010
Springer
14 years 7 months ago
2010
Springer
The transmission capacity of an ad-hoc network is the maximum density of active transmitters in an unit area, given an outage constraint at each receiver for a fixed rate of transm...