1749 search results - page 133 / 350 » Conditional colorings of graphs |
175
click to vote
ICASSP
2010
IEEE
15 years 5 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...
161
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
The use of visual information derived from accurate lip extraction, can provide features invariant to noise perturbation for speech recognition systems and can be also used in a w...
167
click to vote
HVEI
2010
15 years 8 months ago
2010
The overall image quality benefits substantially from good reproduction of black tones. Modern displays feature relatively low black level, making them capable rendering good dark...
139
click to vote
JGT
2008
15 years 6 months ago
2008
The square G2 of a graph G is the graph with the same vertex set as G and with two vertices adjacent if their distance in G is at most 2. Thomassen showed that for a planar graph ...
156
click to vote
DM
2010
15 years 6 months ago
2010
A k-rainbow path in a graph with colored edges is a path of length k where each edge has a different color. In this note, we settle the problem of obtaining a constructive k-colori...