263 search results - page 33 / 53 » Minimum Entropy Coloring |
GC
2007
Springer
14 years 11 months ago
2007
Springer
The pre-coloring extension problem consists, given a graph G and a set of nodes to which some colors are already assigned, in finding a coloring of G with the minimum number of co...
144
click to vote
TCAD
2010
14 years 6 months ago
2010
Abstract--In double patterning lithography (DPL) layout decomposition for 45nm and below process nodes, two features must be assigned opposite colors (corresponding to different ex...
108
click to vote
ICIP
2010
IEEE
14 years 9 months ago
2010
IEEE
Close-up (CU) is a photographic technique which tightly frames a person or an object. In movies, it is applied to guide audience attention and to evoke audience emotion. In this p...
82
Voted
ICIP
2003
IEEE
15 years 5 months ago
2003
IEEE
We present a novel solution to the inter-camera color calibration problem, which is very important for multi-camera systems. We propose a distance metric and a model function to e...
105
click to vote
IWOCA
2009
Springer
15 years 6 months ago
2009
Springer
: We present an improved upper bound of O(d1+ 1 m−1 ) for the (2, F)-subgraph chromatic number χ2,F (G) of any graph G of maximum degree d. Here, m denotes the minimum number of...