246 search results - page 5 / 50 » Distance Coloring |
IPL
2006
14 years 9 months ago
2006
We obtain bounds for the coloring numbers of products of trees for three closely related types of colorings: acyclic, distance 2, and L(2, 1).
CORR
2010
Springer
14 years 9 months ago
2010
Springer
The packing chromatic number (G) of a graph G is the least integer k for which there exists a mapping f from V (G) to {1, 2, . . ., k} such that any two vertices of color i
ICASSP
2010
IEEE
14 years 8 months ago
2010
IEEE
Content-Based Copy Detection (CBCD) of digital videos is an important research field that aims at the identification of modified copies of an original clip, e.g., on the Intern...
3DIM
2005
IEEE
15 years 3 months ago
2005
IEEE
ICCV
2001
IEEE
15 years 11 months ago
2001
IEEE
The Earth Mover's distance was first introduced as a purely empirical way to measure texture and color similarities. We show that it has a rigorous probabilistic interpretati...