1363 search results - page 9 / 273 » The road coloring problem |
105
Voted
FSKD
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. A fuzzy c-means algorithm incorporating the notion of dominant colors and spatial homogeneity is proposed for the color clustering problem. The proposed algorithm extract...
CORR
2007
Springer
14 years 9 months ago
2007
Springer
Abstract. Holzer and Holzer [7] proved that the TantrixTM rotation puzzle problem with four colors is NP-complete, and they showed that the infinite variant of this problem is und...
78
Voted
LATIN
2010
Springer
14 years 8 months ago
2010
Springer
Abstract In this paper, we settle the open complexity status of interval constrained coloring with a fixed number of colors. We prove that the problem is already NP-complete if th...
CVPR
2009
IEEE
16 years 4 months ago
2009
IEEE
This paper estimates illumination colors by using only a
single surface color taken under multiple illumination colors.
Past researchers have found that there is a difficulty in
...
IROS
2006
IEEE
15 years 3 months ago
2006
IEEE
— We report our development of a vision-based motion planning system for an autonomous motorcycle designed for desert terrain, where uniform road surface and lane markings are no...