202 search results - page 1 / 41 » Locally identifying coloring of graphs |
CORR
2010
Springer
13 years 3 months ago
2010
Springer
Let G = (V, E) be a graph. Let c : V → N be a vertex-coloring of the vertices of G. For any vertex u, we denote by N[u] its closed neighborhood (u and its adjacent vertices), an...
ICCV
1998
IEEE
14 years 6 months ago
1998
IEEE
We describe an approach to detecting, locating and normalizing road signs. The approach will apply provided: (i) the signs have stereotypical boundary shapes (i.e. rectangular, or...
GECCO
2006
Springer
13 years 8 months ago
2006
Springer
This paper presents an algorithm for solving a number of generalized graph coloring problems. Specifically, it gives an agent-based algorithm for the Bandwidth Coloring problem. U...
ENDM
2000
13 years 4 months ago
2000
Attempts to solve the famous Four Color Problem led to fruitful discoveries and rich coloring theories. In this talk, some old and some recent applications of tools from topology ...
ICML
2005
IEEE
14 years 5 months ago
2005
IEEE
We present a new subgoal-based method for automatically creating useful skills in reinforcement learning. Our method identifies subgoals by partitioning local state transition gra...