Sciweavers

759 search results - page 63 / 152
» Optimal Graph Search with Iterated Graph Cuts
Sort
View
JUCS
2006
87views more  JUCS 2006»
14 years 9 months ago
Eliminating Redundant Join-Set Computations in Static Single Assignment
: The seminal algorithm developed by Ron Cytron, Jeanne Ferrante and colleagues in 1989 for the placement of -nodes in a control flow graph is still widely used in commercial compi...
Angela French, José Nelson Amaral
CIMCA
2005
IEEE
15 years 3 months ago
A Hybrid Estimation of Distribution Algorithm for the Minimal Switching Graph Problem
Minimal Switching Graph (MSG) is a graphical model for the constrained via minimization problem — a combinatorial optimization problem in integrated circuit design automation. F...
Maolin Tang, Raymond Y. K. Lau
EMMCVPR
2007
Springer
15 years 4 months ago
Continuous Global Optimization in Multiview 3D Reconstruction
Abstract. In this work, we introduce a robust energy model for multiview 3D reconstruction that fuses silhouette- and stereo-based image information. It allows to cope with signiï¬...
Kalin Kolev, Maria Klodt, Thomas Brox, Selim Esedo...
ANOR
2008
66views more  ANOR 2008»
14 years 10 months ago
Optimization problems involving collections of dependent objects
We describe a class of problems motivated by numerous real-world applications where there is a collection of objects that have both a cost and a value, but where some of those obj...
David L. Roberts, Charles L. Isbell, Michael L. Li...
CORR
2012
Springer
249views Education» more  CORR 2012»
13 years 5 months ago
Computing Cartograms with Optimal Complexity
We show how to compute cartograms with worst-case optimal polygonal complexity. Specifically we study rectilinear duals which are side-contact representations of a planar graph G ...
Md. Jawaherul Alam, Therese C. Biedl, Stefan Felsn...