806 search results - page 95 / 162 » Lower Bounds on Correction Networks |
186
click to vote
ISCC
2003
IEEE
15 years 11 months ago
2003
IEEE
— We consider a network of n sender/receiver pairs, placed randomly in a region of unit area. Network capacity, or maximum throughput, is defined as the highest rate that can be...
141
click to vote
TIT
2008
15 years 5 months ago
2008
We address the question of providing throughput guarantees through distributed scheduling, which has remained an open problem for some time. We consider a simple distributed sched...
185
click to vote
INFOCOM
2010
IEEE
15 years 4 months ago
2010
IEEE
—Optimal scheduling for concurrent transmissions in rate-nonadaptive wireless networks is NP-hard. Optimal scheduling in rate-adaptive wireless networks is even more difficult, ...
182
click to vote
CDC
2010
IEEE
15 years 28 days ago
2010
IEEE
This paper is concerned with studying how the minimum power loss in a power system is related to its network topology. The existing algorithms in the literature all exploit nonline...
260
click to vote
ICDE
2007
IEEE
16 years 7 months ago
2007
IEEE
Skyline query processing has been investigated extensively in recent years, mostly for only one query reference point. An example of a single-source skyline query is to find hotel...