Sciweavers

197 search results - page 15 / 40
» Some Topological Methods in Graph Coloring Theory
Sort
View
TCAD
2010
194views more  TCAD 2010»
13 years 3 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...
UAI
2004
13 years 9 months ago
A Complete Anytime Algorithm for Treewidth
In this paper, we present a Branch and Bound algorithm called QuickBB for computing the treewidth of an undirected graph. This algorithm performs a search in the space of perfect ...
Vibhav Gogate, Rina Dechter
COMPGEOM
2005
ACM
13 years 10 months ago
On the exact computation of the topology of real algebraic curves
We consider the problem of computing a representation of the plane graph induced by one (or more) algebraic curves in the real plane. We make no assumptions about the curves, in p...
Raimund Seidel, Nicola Wolpert
TIP
2011
89views more  TIP 2011»
13 years 3 months ago
Random Phase Textures: Theory and Synthesis
This paper explores the mathematical and algorithmic properties of two sample-based microtexture models: random phase noise (RPN ) and asymptotic discrete spot noise (ADSN ). Thes...
Bruno Galerne, Yann Gousseau, Jean-Michel Morel
CSB
2005
IEEE
110views Bioinformatics» more  CSB 2005»
14 years 2 months ago
A Topological Measurement for Weighted Protein Interaction Network
High-throughput methods for detecting protein-protein interactions (PPI) have given researchers an initial global picture of protein interactions on a genomic scale. The usefulnes...
Pengjun Pei, Aidong Zhang