765 search results - page 84 / 153 » Graph Coloring with Rejection |
IPL
2011
13 years 3 months ago
2011
In this paper, we use the concept of edge-colored graphs to model homogeneous faults in networks. We then use this model to study the minimum connectivity (and design) requirement...
TCAD
2010
13 years 3 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...
DAC
2009
ACM
14 years 3 months ago
2009
ACM
For a computing system to be trusted, it is equally important to verify that the system performs no more and no less functionalities than desired. Traditional testing and verifica...
CRV
2008
IEEE
14 years 3 months ago
2008
IEEE
In this paper, we propose a novel method for the automatic segmentation of a foreground layer from a natural scene in real time by fusing infrared, color and edge information. Thi...
FOCS
2003
IEEE
14 years 2 months ago
2003
IEEE
We study a simple Markov chain, known as the Glauber dynamics, for randomly sampling (proper) k-colorings of an input graph G on n vertices with maximum degree ∆ and girth g. We...