5052 search results - page 11 / 1011 » On the Complexity of Ordered Colorings |
IMAGING
2003
13 years 9 months ago
2003
An interactive program has been developed to assist in the design of new goniochromatic colors. The program gives the user a unique set of controls over a second order polynomial ...
CAE
2007
13 years 11 months ago
2007
This paper proposes two simple and powerful algorithms to automatically paint Celtic knots with aesthetic colors. The shape of the knot is generated from its dual graph as present...
ENDM
2006
13 years 8 months ago
2006
Many classes of graphs where the vertex coloring problem is polynomially solvable are known, the most prominent being the class of perfect graphs. However, the list-coloring proble...
ICAT
2007
IEEE
14 years 2 months ago
2007
IEEE
This study concerns the development of 3D interfaces that aid the navigation of large data structures through the usage of the HSV color space, and the ensuing “spatial framesâ€...
ICIP
1999
IEEE
14 years 10 months ago
1999
IEEE
This work concentrates on the problem of watermarking embedding and optimum detection in color images through the use of spread spectrum techniques, both in space (Direct Sequence...