Sciweavers

161 search results - page 18 / 33
» Structural decompositions for problems with global constrain...
Sort
View
CVPR
2010
IEEE
15 years 5 months ago
Disambiguating Visual Relations Using Loop Constraints
Repetitive and ambiguous visual structures in general pose a severe problem in many computer vision applications. Identification of incorrect geometric relations between images s...
Christopher Zach, Manfred Klopschitz, Marc Pollefe...
3DPVT
2006
IEEE
213views Visualization» more  3DPVT 2006»
15 years 3 months ago
Generalized RANSAC Framework for Relaxed Correspondence Problems
Finding correspondences between two (widely) separated views is essential for several computer vision tasks, such as structure and motion estimation and object recognition. In the...
Wei Zhang, Jana Kosecka
CCE
2004
14 years 9 months ago
Computational studies using a novel simplicial-approximation based algorithm for MINLP optimization
Significant advances have been made in the last two decades for the effective solution of mixed integer non-linear programming (MINLP) problems, mainly by exploiting the special s...
Vishal Goyal, Marianthi G. Ierapetritou
ICML
2009
IEEE
15 years 10 months ago
A convex formulation for learning shared structures from multiple tasks
Multi-task learning (MTL) aims to improve generalization performance by learning multiple related tasks simultaneously. In this paper, we consider the problem of learning shared s...
Jianhui Chen, Lei Tang, Jun Liu, Jieping Ye
AAAI
2007
14 years 12 months ago
Counting CSP Solutions Using Generalized XOR Constraints
We present a general framework for determining the number of solutions of constraint satisfaction problems (CSPs) with a high precision. Our first strategy uses additional binary...
Carla P. Gomes, Willem Jan van Hoeve, Ashish Sabha...