630 search results - page 77 / 126 » Hardness results for approximating the bandwidth |
210
click to vote
TKDE
2012
13 years 8 months ago
2012
— We study the problem of assigning subscribers to brokers in a wide-area content-based publish/subscribe system. A good assignment should consider both subscriber interests in t...
161
click to vote
IWPEC
2009
Springer
16 years 22 days ago
2009
Springer
We study the parameterized complexity of two families of problems: the bounded length disjoint paths problem and the bounded length cut problem. From Menger’s theorem both proble...
178
click to vote
GLOBECOM
2009
IEEE
16 years 28 days ago
2009
IEEE
—Wired and wireless data networks have witnessed an explosive growth of inelastic traffics such as real-time or media streaming applications. Recently, applications relying on l...
180
click to vote
INFOCOM
2009
IEEE
16 years 25 days ago
2009
IEEE
—The emerging wireless relay networks (WRNs) are expected to provide significant improvement on throughput and extension of coverage area for next-generation wireless systems. W...
132
click to vote
ICC
2007
IEEE
16 years 15 days ago
2007
IEEE
– In this paper, we consider a novel spatial diversity scheme for a mutually cooperative relay (MCR) system in which two active users are simultaneously communicating with the sa...