120 search results - page 4 / 24 » Some New Ramsey Colorings |
ENDM
2006
13 years 7 months ago
2006
Greedy algorithm sometimes uses more than (G) colors while coloring a graph G. A greedy defining set is an object to eliminate these extra colors so that the greedy coloring resul...
PLDI
2004
ACM
14 years 23 days ago
2004
ACM
Graph-coloring register allocation is an elegant and extremely popular optimization for modern machines. But as currently formulated, it does not handle two characteristics common...
ICPR
2000
IEEE
14 years 8 months ago
2000
IEEE
Color features are among the most important features used in image database retrieval, especially in cases where no additional semantic information is available. Due to its compac...
IMAGING
2003
13 years 8 months ago
2003
Current color-printing technologies may use three or more inks, e.g., CMY, CMYK, CMYKcm, CMYKGO, CMYKRGB. When the number of inks exceeds three, there is the usual color-managemen...
ICIP
2001
IEEE
14 years 9 months ago
2001
IEEE
This paper presents a new technique based on anisotropic diffusion for segmenting color images. This operation is accomplished through two independent anisotropic diffusion proces...