Sciweavers

485 search results - page 53 / 97
» Unconstraint Assignment Problem: A Molecular Computing Appro...
Sort
View
INFORMS
1998
150views more  INFORMS 1998»
13 years 7 months ago
Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming
constraint abstractions into integer programming, and to discuss possible combinations of the two approaches. Combinatorial problems are ubiquitous in many real world applications ...
Alexander Bockmayr, Thomas Kasper
CVPR
2011
IEEE
13 years 3 months ago
Energy Based Multiple Model Fitting for Non-Rigid Structure from Motion
In this paper we reformulate the 3D reconstruction of deformable surfaces from monocular video sequences as a labeling problem. We solve simultaneously for the assignment of featu...
Chris Russell, Joao Fayad, Lourdes Agapito
ACL
1992
13 years 8 months ago
GPSM: A Generalized Probabilistic Semantic Model for Ambiguity Resolution
In natural language processing, ambiguity resolution is a central issue, and can be regarded as a preference assignment problem. In this paper, a Generalized Probabilistic Semanti...
Jing-Shin Chang, Yih-Fen Luo, Keh-Yih Su
CVPR
2009
IEEE
15 years 2 months ago
A Tensor-Based Algorithm for High-Order Graph Matching
This paper addresses the problem of establishing correspondences between two sets of visual features using higher-order constraints instead of the unary or pairwise ones used in...
Francis R. Bach, In-So Kweon, Jean Ponce, Olivier ...
CVPR
2004
IEEE
14 years 9 months ago
Segment-Based Stereo Matching Using Graph Cuts
In this paper, we present a new segment-based stereo matching algorithm using graph cuts. In our approach, the reference image is divided into non-overlapping homogeneous segments...
Li Hong, George Chen