255 search results - page 28 / 51 » A new upper bound for the bipartite Ramsey problem |
159
click to vote
STOC
2001
ACM
16 years 6 months ago
2001
ACM
Consider a setting in which a group of nodes, situated in a large underlying network, wishes to reserve bandwidth on which to support communication. Virtual private networks (VPNs...
207
click to vote
APPROX
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. We give a (ln n + 1)-approximation for the decision tree (DT) problem. An instance of DT is a set of m binary tests T = (T1, . . . , Tm) and a set of n items X = (X1, . ....
163
click to vote
IPL
2007
15 years 6 months ago
2007
The online frequency allocation problem for cellular networks has been well studied in these years. Given a mobile telephone network, whose geographical coverage area is divided i...
202
click to vote
WINET
2011
15 years 1 months ago
2011
Abstract—We consider the problem of aggregation convergecast scheduling in wireless sensor networks. Aggregation convergecast differs from regular convergecast in that it accommo...
163
click to vote
INFOCOM
2008
IEEE
16 years 15 days ago
2008
IEEE
—Aggregate scheduling is one of the most promising solutions to the issue of scalability in networks, like DiffServ networks and high speed switches, where hard QoS guarantees ar...