Sciweavers

1833 search results - page 9 / 367
» A Matrix-Based Approach to the Global Locality Optimization ...
Sort
View
EOR
2008
79views more  EOR 2008»
13 years 8 months ago
Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem
The 0-1 Multidimensional Knapsack Problem (0-1 MKP) is a wellknown (and strongly NP-hard) combinatorial optimization problem with many applications. Up to now, the majority of upp...
Konstantinos Kaparis, Adam N. Letchford
CVPR
2010
IEEE
13 years 10 months ago
Simultaneous Searching of Globally Optimal Interacting Surfaces with Shape Priors
Multiple surface searching with only image intensity information is a difficult job in the presence of high noise and weak edges. We present in this paper a novel method for global...
Qi Song, Xiaodong Wu, Yunlong Liu, Mona Garvin, Mi...
ICCV
2011
IEEE
12 years 8 months ago
Optimal Landmark Detection using Shape Models and Branch and Bound
Fitting statistical 2D and 3D shape models to images is necessary for a variety of tasks, such as video editing and face recognition. Much progress has been made on local fitting...
Brian Amberg, Thomas Vetter
ICIP
2008
IEEE
14 years 3 months ago
Globally optimal solution to exploit rigidity when recovering structure from motion under occlusion
Widely used SVD-based matrix factorization approaches to the recovery of 3D rigid structure from motion (SFM), require a set of feature points to be visible in a set of images. Wh...
Pedro M. Q. Aguiar, João M. F. Xavier, Mark...
CG
2004
Springer
14 years 9 days ago
Locally Informed Global Search for Sums of Combinatorial Games
Abstract. There are two complementary approaches to playing sums of combinatorial games. They can be characterized as local analysis and global search. Algorithms from combinatoria...
Martin Müller 0003, Zhichao Li