Sciweavers

720 search results - page 83 / 144
» Nonrepetitive colorings of graphs
Sort
View
TCAD
2010
194views more  TCAD 2010»
13 years 2 months ago
Layout Decomposition Approaches for Double Patterning Lithography
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...
Andrew B. Kahng, Chul-Hong Park, Xu Xu, Hailong Ya...
DAC
2009
ACM
14 years 2 months ago
Information hiding for trusted system design
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...
Junjun Gu, Gang Qu, Qiang Zhou
CRV
2008
IEEE
183views Robotics» more  CRV 2008»
14 years 2 months ago
Robust Real-Time Bi-Layer Video Segmentation Using Infrared Video
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...
Qiong Wu, Pierre Boulanger, Walter F. Bischof
FOCS
2003
IEEE
14 years 29 days ago
A Non-Markovian Coupling for Randomly Sampling Colorings
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...
Thomas P. Hayes, Eric Vigoda
APPROX
2006
Springer
88views Algorithms» more  APPROX 2006»
13 years 11 months ago
Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs
Motivated by applications in batch scheduling of jobs in manufacturing systems and distributed computing, we study two related problems. Given is a set of jobs {J1, . . . , Jn}, w...
Leah Epstein, Magnús M. Halldórsson,...