1208 search results - page 63 / 242 » On Counting Generalized Colorings |
APPINF
2003
13 years 10 months ago
2003
This paper presents an adaptive colour segmentation algorithm for Sony legged robots to play a football game. A Self-Organizing Map (SOM) is adopted to measure the current lightin...
SODA
2000
ACM
13 years 10 months ago
2000
ACM
We give nontrivial bounds for the inductiveness or degeneracy of power graphs Gk of a planar graph G. This implies bounds for the chromatic number as well, since the inductiveness ...
DAM
2008
13 years 9 months ago
2008
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...
DM
2006
13 years 9 months ago
2006
For an integer r > 0, a conditional (k, r)-coloring of a graph G is a proper k-coloring of the vertices of G such that every vertex of degree at least r in G will be adjacent t...
ICASSP
2011
IEEE
13 years 25 days ago
2011
IEEE
In this paper, we study speech enhancement in eigen-domain. In our previous work on audible noise reduction, we use masking properties of the human auditory system to define the ...