Sciweavers

1483 search results - page 197 / 297
» Geometric constraint satisfaction using optimization methods
Sort
View
IVC
2010
289views more  IVC 2010»
13 years 9 months ago
Automatic 3D object segmentation in multiple views using volumetric graph-cuts
We propose an algorithm for automatically obtaining a segmentation of a rigid object in a sequence of images that are calibrated for camera pose and intrinsic parameters. Until re...
Neill D. F. Campbell, George Vogiatzis, Carlos Her...
AI
2006
Springer
13 years 11 months ago
Cut-and-solve: An iterative search strategy for combinatorial optimization problems
Branch-and-bound and branch-and-cut use search trees to identify optimal solutions to combinatorial optimization problems. In this paper, we introduce an iterative search strategy...
Sharlee Climer, Weixiong Zhang
ICCAD
2009
IEEE
117views Hardware» more  ICCAD 2009»
13 years 9 months ago
Binning optimization based on SSTA for transparently-latched circuits
With increasing process variation, binning has become an important technique to improve the values of fabricated chips, especially in high performance microprocessors where transpa...
Min Gong, Hai Zhou, Jun Tao, Xuan Zeng
SIAMSC
2010
114views more  SIAMSC 2010»
13 years 9 months ago
Smoothed Aggregation Multigrid for Markov Chains
Abstract. A smoothed aggregation multigrid method is presented for the numerical calculation of the stationary probability vector of an irreducible sparse Markov chain. It is shown...
Hans De Sterck, Thomas A. Manteuffel, Stephen F. M...
WCE
2007
14 years 9 days ago
Local Approximation of Pareto Surface
—In the design process of complex systems, the designer is solving an optimization problem, which involves different disciplines and where all design criteria have to be optimize...
S. V. Utyuzhnikov, Jeremy Maginot, Marin D. Guenov