Sciweavers

920 search results - page 133 / 184
» Generating Satisfiable Problem Instances
Sort
View
TCAD
2011
13 years 3 months ago
GRIP: Global Routing via Integer Programming
Abstract—This work introduces GRIP, a global routing technique via integer programming. GRIP optimizes wirelength and via cost directly without going through a traditional layer ...
Tai-Hsuan Wu, Azadeh Davoodi, Jeffrey T. Linderoth
CVPR
2001
IEEE
14 years 11 months ago
Single View Modeling of Free-Form Scenes
This paper presents a novel approach for reconstructing free-form, texture-mapped, 3D scene models from a single painting or photograph. Given a sparse set of user-specified const...
Li Zhang, Guillaume Dugas-Phocion, Jean-Sebastien ...
SIGSOFT
2009
ACM
14 years 9 months ago
Fitting the pieces together: a machine-checked model of safe composition
Programs of a software product line can be synthesized by composing features which implement a unit of program functionality. In most product lines, only some combination of featu...
Benjamin Delaware, William R. Cook, Don S. Batory
VLSID
2002
IEEE
92views VLSI» more  VLSID 2002»
14 years 9 months ago
Electromigration Avoidance in Analog Circuits: Two Methodologies for Current-Driven Routing
Interconnect with an insufficient width may be subject to electromigration and eventually cause the failure of the circuit at any time during its lifetime. This problem has gotten...
Jens Lienig, Goeran Jerke, Thorsten Adler
EDBT
2008
ACM
166views Database» more  EDBT 2008»
14 years 9 months ago
A novel spectral coding in a large graph database
Retrieving related graphs containing a query graph from a large graph database is a key issue in many graph-based applications, such as drug discovery and structural pattern recog...
Lei Zou, Lei Chen 0002, Jeffrey Xu Yu, Yansheng Lu