5052 search results - page 3 / 1011 » On the Complexity of Ordered Colorings |
CORR
2010
Springer
13 years 3 months ago
2010
Springer
We establish a simple generalization of a known result in the plane. The simplices in any pure simplicial complex in Rd may be colored with d+1 colors so that no two simplices tha...
ICIP
1998
IEEE
14 years 7 months ago
1998
IEEE
In this paper, we describe a new approach for color image segmentation which is considered as a problem of pixels classification. The algorithm is applied to classify pixels of so...
ICMCS
1999
IEEE
13 years 10 months ago
1999
IEEE
In this paper, we propose a novel scheme for automatic and fast detection of human faces in color images where the number, the location, the orientation and the size of the faces ...
COCOA
2007
Springer
14 years 13 days ago
2007
Springer
Abstract. We study the complexity of several coloring problems on graphs, parameterized by the treewidth t of the graph: (1) The list chromatic number χl(G) of a graph G is defin...
ICISP
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. When the amount of color data is reduced in a lossy compression scheme, the question of the use of a color distance is crucial, since no total order exists in IRn