1363 search results - page 68 / 273 » The road coloring problem |
IROS
2006
IEEE
15 years 3 months ago
2006
IEEE
- The ICP (Iterative Closest Point) algorithm remains a very popular method for the registration of 3D data sets, when an initial guess of the relative pose between them is known. ...
GC
2007
Springer
14 years 9 months ago
2007
Springer
Let Qn be a hypercube of dimension n, that is, a graph whose vertices are binary n-tuples and two vertices are adjacent iff the corresponding n-tuples differ in exactly one posit...
110
click to vote
ICIP
2003
IEEE
15 years 11 months ago
2003
IEEE
Robust real-time tracking of non-rigid objects in a dynamic environment is a challenging task. Among various cues in tracking, color can provide an efficient visual cue for this t...
ISAAC
2005
Springer
15 years 3 months ago
2005
Springer
Abstract We study an information-theoretic variant of the graph coloring problem in which the objective function to minimize is the entropy of the coloring. The minimum entropy of ...
ALGORITHMICA
2006
14 years 10 months ago
2006
We consider the problem of coloring a planar graph with the minimum number of colors so that each color class avoids one or more forbidden graphs as subgraphs. We perform a detail...