227 search results - page 5 / 46 » Weighted Coloring: Further Complexity and Approximability Re... |
IPCO
1998
13 years 9 months ago
1998
We provide several non-approximability results for deterministic scheduling problems whose objective is to minimize the total job completion time. Unless P = NP, none of the probl...
ICIP
2007
IEEE
14 years 9 months ago
2007
IEEE
Abstract - The proposed algorithm in this work provides superresolution for color images by using a learning based technique that utilizes both generative and discriminant approach...
ICALP
2011
Springer
12 years 11 months ago
2011
Springer
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...
TAMC
2010
Springer
14 years 22 days ago
2010
Springer
In this paper, we establish the definition of community fundamentally different from what was commonly accepted in previous studies, where communities were typically assumed to ...
IMAGING
2004
13 years 9 months ago
2004
We examine mathematical properties of the CIEDE2000 color difference formula and illustrate that the CIEDE2000 color difference is not a continuous function of the CIELAB color pa...