266 search results - page 43 / 54 » Chromatic Ramsey numbers |
CVPR
2010
IEEE
13 years 11 months ago
2010
IEEE
In this paper, we present an appearance-based method for person re-identification. It consists in the extraction of features that model three complementary aspects of the human ap...
SPIESR
2000
13 years 8 months ago
2000
Color object recognition methods that are based on image retrieval algorithms can handle changes of illumination via image normalization, e.g. simple color-channel-normalization1 ...
SODA
2004
ACM
13 years 8 months ago
2004
ACM
We study vertex colorings of the square G2 of an outerplanar graph G. We find the optimal bound of the inductiveness, chromatic number and the clique number of G2 as a function of...
COMBINATORICA
2008
13 years 7 months ago
2008
A random geometric graph Gn is constructed by taking vertices X1, . . . , Xn Rd at random (i.i.d. according to some probability distribution with a bounded density function) and...
COMBINATORICS
2007
13 years 7 months ago
2007
The distinguishing number ∆(X) of a graph X is the least positive integer n for which there exists a function f : V (X) → {0, 1, 2, · · · , n−1} such that no nonidentity ...