Sciweavers

351 search results - page 26 / 71
» An exact method for graph coloring
Sort
View
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
ALGORITHMICA
2008
82views more  ALGORITHMICA 2008»
13 years 7 months ago
Random Bichromatic Matchings
Given a graph with edges colored Red and Blue, we wish to sample and approximately count the number of perfect matchings with exactly k Red edges. We study a Markov chain on the sp...
Nayantara Bhatnagar, Dana Randall, Vijay V. Vazira...
ECCV
2002
Springer
14 years 9 months ago
Multi-camera Scene Reconstruction via Graph Cuts
We address the problem of computing the 3-dimensional shape of an arbitrary scene from a set of images taken at known viewpoints. Multi-camera scene reconstruction is a natural gen...
Vladimir Kolmogorov, Ramin Zabih
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...
ICPR
2008
IEEE
14 years 9 months ago
Seamless image-based texture atlases using multi-band blending
In this paper, we propose a novel method for creating a high-quality texture atlas from a 3D model and a set of calibrated images. Our method focuses on avoiding visual artifacts ...
Cédric Allène, Jean-Philippe Pons, R...