Sciweavers

442 search results - page 2 / 89
» Representing Colors as Three Numbers
Sort
View
DAM
2008
88views more  DAM 2008»
13 years 5 months ago
On the asymmetric representatives formulation for the vertex coloring problem
We consider the vertex coloring problem, which may be stated as the problem of minimizing the number of labels that can be assigned to the vertices of a graph G such that each ver...
Manoel B. Campêlo, Victor A. Campos, Ricardo...
AMC
2005
178views more  AMC 2005»
13 years 5 months ago
Color image segmentation based on three levels of texture statistical evaluation
In this paper a new and efficient supervised method for color image segmentation is presented. This method improves a part of the automatic extraction problem. The basic technique...
Juan B. Mena, José A. Malpica
COCOON
2007
Springer
13 years 11 months ago
Colored Simultaneous Geometric Embeddings
We introduce the concept of colored simultaneous geometric embeddings as a generalization of simultaneous graph embeddings with and without mapping. We show that there exists a uni...
Ulrik Brandes, Cesim Erten, J. Joseph Fowler, Fabr...
SIROCCO
2007
13 years 6 months ago
Location Oblivious Distributed Unit Disk Graph Coloring
We present the first location oblivious distributed unit disk graph coloring algorithm having a provable performance ratio of three (i.e. the number of colors used by the algorit...
Mathieu Couture, Michel Barbeau, Prosenjit Bose, P...
ICIP
2002
IEEE
14 years 6 months ago
On the non-optimality of four color coding of image partitions
Recent interest in region based image coding has given rise to graph coloring based partition encoding methods. These methods are based on the four color theorem for planar graphs...
Sameer Agarwal, Serge Belongie