Sciweavers

630 search results - page 47 / 126
» Hardness results for approximating the bandwidth
Sort
View
SODA
2008
ACM
84views Algorithms» more  SODA 2008»
15 years 2 months ago
Robust cost colorings
We consider graph coloring problems where the cost of a coloring is the sum of the costs of the colors, and the cost of a color is a monotone concave function of the total weight ...
Takuro Fukunaga, Magnús M. Halldórss...
135
Voted
CVPR
2007
IEEE
16 years 2 months ago
Detection and segmentation of moving objects in highly dynamic scenes
Detecting and segmenting moving objects in dynamic scenes is a hard but essential task in a number of applications such as surveillance. Most existing methods only give good resul...
Aurélie Bugeau, Patrick Pérez
95
Voted
CN
2007
116views more  CN 2007»
15 years 16 days ago
Joint call and packet QoS in cellular packet networks
This paper proposes a novel call admission control scheme capable of providing a combination of call and packet level quality of service requirements in cellular packet networks. ...
Majid Ghaderi, Raouf Boutaba, Gary W. Kenward
124
Voted
MTA
2011
219views Hardware» more  MTA 2011»
14 years 7 months ago
Network-adaptive autonomic transcoding algorithm for seamless streaming media service of mobile clients
As a result of improvements in wireless communication technologies, a multimedia data streaming service can now be provided for mobile clients. Since mobile devices have low comput...
Dongmahn Seo, Inbum Jung
116
Voted
SEUS
2009
IEEE
15 years 7 months ago
Towards Time-Predictable Data Caches for Chip-Multiprocessors
Future embedded systems are expected to use chip-multiprocessors to provide the execution power for increasingly demanding applications. Multiprocessors increase the pressure on th...
Martin Schoeberl, Wolfgang Puffitsch, Benedikt Hub...