1363 search results - page 47 / 273 » The road coloring problem |
139
click to vote
CC
2006
Springer
15 years 6 months ago
2006
Springer
The sum of a coloring is the sum of the colors assigned to the vertices (assuming that the colors are positive integers). The sum (G) of graph G is the smallest sum that can be ach...
172
click to vote
ICDAR
2011
IEEE
14 years 5 months ago
2011
IEEE
—In this paper, a novel Chinese character localization method is proposed for texts in advertising images. To deal with the texts with gradient color, a color clustering method b...
155
click to vote
ICIP
2005
IEEE
15 years 11 months ago
2005
IEEE
The problem of adjusting the color such that the output image from a digital camera, viewed under a standard condition, matches the scene observed by the photographer’s eye is c...
153
click to vote
ESA
2007
Springer
16 years 8 days ago
2007
Springer
Given a graph G = (V, E), a (d, k)-coloring is a function from the vertices V to colors {1, 2, . . . , k} such that any two vertices within distance d of each other are assigned di...
167
Voted
SODA
2008
ACM
15 years 7 months ago
2008
ACM
We consider graph coloring problems where the cost of a coloring is the sum of the costs of the colors, and the cost of a color is a monotone concave function of the total weight ...