145 search results - page 16 / 29 » Strong Colorings of Hypergraphs |
88
Voted
PODC
2006
ACM
15 years 3 months ago
2006
ACM
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...
ICMCS
2007
IEEE
15 years 3 months ago
2007
IEEE
Natural image matting plays an important role in image and video editing. It has been addressed hotly because it is inherently an under-constrained problem – we must estimate bo...
DAM
2011
14 years 4 months ago
2011
In this paper, we study the Minimum Sum Set Coloring (MSSC) problem which consists in assigning a set of x(v) positive integers to each vertex v of a graph so that the intersectio...
76
Voted
IMAGING
2004
14 years 11 months ago
2004
A Bayesian method of generating color correction matrices for digital image sensors is presented. This method was developed for sensors with poor colorimetric quality, and uses st...
SIAMDM
2008
14 years 9 months ago
2008
We consider the class of graphs that contain no bull, no odd hole, and no antihole of length at least five. We present a new algorithm that colors optimally the vertices of every g...