1177 search results - page 82 / 236 » Iterative methods for Robbins problems |
133
Voted
ACST
2006
15 years 1 months ago
2006
A constraint satisfaction problem (CSP) is a general framework that can formalize various application problems in artificial intelligence. However, practical real-world problems t...
129
Voted
ICCV
2011
IEEE
14 years 16 days ago
2011
IEEE
We present a generalized subgraph preconditioning (GSP) technique to solve large-scale bundle adjustment problems efficiently. In contrast with previous work which uses either di...
138
click to vote
CVPR
2012
IEEE
13 years 2 months ago
2012
IEEE
In this paper, we raise important issues on scalability and the required degree of supervision of existing Mahalanobis metric learning methods. Often rather tedious optimization p...
AAAI
1998
15 years 1 months ago
1998
Wepropose a method called Selection by Performance Prediction (SPP) which allows one, when faced with a particular problem instance, to select a Branch and Boundalgorithm from amo...
108
Voted
ICPR
2000
IEEE
16 years 1 months ago
2000
IEEE
This paper presents a cooperative strategy between volumetric registration and segmentation. The segmentation method is based on the level set formalism. Starting from an initial ...