Sciweavers

1429 search results - page 121 / 286
» The Complexity of the Approximation of the Bandwidth Problem
Sort
View
INFOCOM
2005
IEEE
14 years 2 months ago
Credit based fair scheduling for packet switched networks
With the rapid development of Internet multimedia applications, the next generation of networks is required to schedule not only the best effort traffic but also the traffic wit...
Deng Pan, Yuanyuan Yang
IWPEC
2004
Springer
14 years 2 months ago
Packing Edge Disjoint Triangles: A Parameterized View
The problem of packing k edge-disjoint triangles in a graph has been thoroughly studied both in the classical complexity and the approximation fields and it has a wide range of ap...
Luke Mathieson, Elena Prieto, Peter Shaw
ICIP
2002
IEEE
14 years 10 months ago
Efficient partitioning of unequal error protected MPEG video streams for multiple channel transmission
Reliable transmission of video over wireless networks must address the limited bandwidth and the possibility of loss. When the bandwidth is insufficient on a single channel, the v...
Wen Xu, Sheila S. Hemami
INFOCOM
2007
IEEE
14 years 3 months ago
Statistical Multiplexing Over DSL Networks
— Most previous work in statistical multiplexing only considered the case where the link transmission rates are fixed. In this paper, we consider statistical multiplexing in net...
Jianwei Huang, Chee-Wei Tan, Mung Chiang, Raphael ...
MM
2009
ACM
160views Multimedia» more  MM 2009»
14 years 3 months ago
On statistical multiplexing of variable-bit-rate video streams in mobile systems
We consider the problem of broadcasting multiple variable-bit-rate (VBR) video streams from a base station to many mobile devices over a wireless network, so that: (i) perceived q...
Cheng-Hsin Hsu, Mohamed Hefeeda