34 search results - page 4 / 7 » Total Colorings Of Degenerate Graphs |
DAC
2009
ACM
15 years 10 months ago
2009
ACM
Current compilers lack precise timing models guiding their built-in optimizations. Hence, compilers apply ad-hoc heuristics during optimization to improve code quality. One of the...
115
click to vote
ICCI
1991
15 years 28 days ago
1991
The problem of coloring a set of n intervals (from the real line) with a set of k colors is studied. In such a coloring, two intersecting intervals must receive distinct colors. O...
114
click to vote
CIMAGING
2009
14 years 10 months ago
2009
We introduce "contour stencils" as a simple method for detecting the local orientation of image contours and apply this detection to image zooming. Our approach is motiv...
SIAMJO
2008
14 years 9 months ago
2008
Abstract. We consider the offline and online versions of a bin packing problem called bin packing with conflicts. Given a set of items V = {1, 2, . . . , n} with sizes s1, s2 . . ....
132
click to vote
CRV
2008
IEEE
15 years 3 months ago
2008
IEEE
In this paper, we propose a novel method for the automatic segmentation of a foreground layer from a natural scene in real time by fusing infrared, color and edge information. Thi...