1729 search results - page 284 / 346 » On Bounds for the k-Partitioning of Graphs |
INFOCOM
2008
IEEE
15 years 4 months ago
2008
IEEE
In this paper, we characterize the performance of an important class of scheduling schemes, called Greedy Maximal Scheduling (GMS), for multi-hop wireless networks. While a lower ...
ISCC
2008
IEEE
15 years 4 months ago
2008
IEEE
This work addresses the high-rate session scheduling problem in Fractional Lambda Switching (FλS) networks. With its global phase synchronization and pipeline forwarding (PF) ope...
GBRPR
2007
Springer
15 years 4 months ago
2007
Springer
Segmentation algorithms based on an energy minimisation framework often depend on a scale parameter which balances a fit to data and a regularising term. Irregular pyramids are de...
ICDCS
2006
IEEE
15 years 4 months ago
2006
IEEE
This paper studies compact routing schemes for networks with low doubling dimension. Two variants are explored, name-independent routing and labeled routing. The key results obtai...
PODC
2005
ACM
15 years 3 months ago
2005
ACM
In this paper, we initiate the study of the approximability of the facility location problem in a distributed setting. In particular, we explore a trade-off between the amount of...