112 search results - page 15 / 23 » An edge colouring of multigraphs |
EJC
2008
13 years 10 months ago
2008
The adaptable chromatic number of a graph G is the smallest integer k such that for any edge k-colouring of G there exists a vertex kcolouring of G in which the same colour never ...
ECCV
2002
Springer
14 years 11 months ago
2002
Springer
Illumination conditions cause problems for many computer vision algorithms. Inparticular, shadows in an image can cause segmentation, tracking, or recognition algorithms to fail. I...
DM
1998
13 years 9 months ago
1998
Suppose G is a graph. The chromatic Ramsey number rc(G) of G is the least integer m such that there exists a graph F of chromatic number m for which the following is true: For any...
ICPR
2000
IEEE
14 years 11 months ago
2000
IEEE
To achieve a face recognition system robust to the presence of glasses, we have developped a glasses detection and extraction algorithm. Detection is realized using edge informati...
STOC
2003
ACM
14 years 10 months ago
2003
ACM
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...