Sciweavers

642 search results - page 120 / 129
» Approximation Algorithms for Minimum K-Cut
Sort
View
WG
2009
Springer
14 years 2 months ago
Sub-coloring and Hypo-coloring Interval Graphs
In this paper, we study the sub-coloring and hypo-coloring problems on interval graphs. These problems have applications in job scheduling and distributed computing and can be used...
Rajiv Gandhi, Bradford Greening, Sriram V. Pemmara...
ICC
2007
IEEE
102views Communications» more  ICC 2007»
14 years 2 months ago
Power Allocation in Multi-Carrier Networks with Unicast and Multicast Services
—Since the provision of both unicast and multicast services is expected for the next generation of multi-carrier wireless systems, the allocation of resources for this combinatio...
Yuri C. B. Silva, Anja Klein
WAIM
2007
Springer
14 years 1 months ago
Building Data Synopses Within a Known Maximum Error Bound
The constructions of Haar wavelet synopses for large data sets have proven to be useful tools for data approximation. Recently, research on constructing wavelet synopses with a gua...
Chaoyi Pang, Qing Zhang, David P. Hansen, Anthony ...
ICMCS
2006
IEEE
153views Multimedia» more  ICMCS 2006»
14 years 1 months ago
RESP: Shortest-Path-Based Cache Replacement in a Transcoding Proxy
In this paper, we discuss the cache replacement policy in a multimedia transcoding proxy. Unlike the cache replacement for conventional web objects, to replace some elements with ...
Hao-Ping Hung, Ming-Syan Chen
WAOA
2005
Springer
161views Algorithms» more  WAOA 2005»
14 years 1 months ago
"Almost Stable" Matchings in the Roommates Problem
An instance of the classical Stable Roommates problem (sr) need not admit a stable matching. This motivates the problem of finding a matching that is “as stable as possible”, ...
David J. Abraham, Péter Biró, David ...