263 search results - page 7 / 53 » Minimum Entropy Coloring |
ICMCS
2006
IEEE
15 years 5 months ago
2006
IEEE
An adaptive robust image watermarking technique for color image authentication is proposed. In the proposed approach, the Y channel of a Yuv color host image and a concatenated RG...
EVOW
2010
Springer
15 years 5 months ago
2010
Springer
We present an algorithmic approach to solving the problem of chromatic entropy, a combinatorial optimization problem related to graph coloring. This problem is a component in algor...
DAGM
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. An information theoretic framework for grouping observations is proposed. The entropy change incurred by new observations is analyzed using the Kalman filter update equa...
106
click to vote
CORR
2007
Springer
14 years 11 months ago
2007
Springer
We study the following two functions: d(n, c) and d(n, c); d(n, c) (d(n, c)) is the minimum number k such that every c-edge-colored undirected (directed) graph of order n and mini...
113
click to vote
ENDM
2006
14 years 12 months ago
2006
Greedy algorithm sometimes uses more than (G) colors while coloring a graph G. A greedy defining set is an object to eliminate these extra colors so that the greedy coloring resul...