759 search results - page 135 / 152 » Optimal Graph Search with Iterated Graph Cuts |
ISPD
2000
ACM
15 years 2 months ago
2000
ACM
modules can be handled in constraint graphs efficiently. This Floorplan area minimization is an important problem because many modules have shape flexibilities during the floorplan...
74
Voted
ECCV
2006
Springer
15 years 11 months ago
2006
Springer
We introduce a new approach to modelling gradient flows of contours and surfaces. While standard variational methods (e.g. level sets) compute local interface motion in a different...
120
click to vote
CP
2003
Springer
15 years 2 months ago
2003
Springer
Multiple sequence alignment is a central problem in Bioinformatics. A known integer programming approach is to apply branch-and-cut to exponentially large graph-theoretic models. T...
109
click to vote
SMI
2007
IEEE
15 years 3 months ago
2007
IEEE
In this paper, we propose a new algorithm for the fundamental problem of reconstructing surfaces from a large set of unorganized 3D data points. The local shapes of the surface ar...
EMMCVPR
2001
Springer
15 years 2 months ago
2001
Springer
Recent work (Yedidia, Freeman, Weiss [22]) has shown that stable points of belief propagation (BP) algorithms [12] for graphs with loops correspond to extrema of the Bethe free ene...