112 search results - page 12 / 23 » Approximate methods for convex minimization problems with se... |
ICPR
2008
IEEE
14 years 8 months ago
2008
IEEE
In this paper we consider the problem of solving different pose and registration problems under rotational constraints. Traditionally, methods such as the iterative closest point ...
DAGM
2008
Springer
13 years 9 months ago
2008
Springer
We investigate maximum likelihood parameter learning in Conditional Random Fields (CRF) and present an empirical study of pseudo-likelihood (PL) based approximations of the paramet...
EMNLP
2010
13 years 5 months ago
2010
We present a unified view of two state-of-theart non-projective dependency parsers, both approximate: the loopy belief propagation parser of Smith and Eisner (2008) and the relaxe...
CRV
2006
IEEE
14 years 1 months ago
2006
IEEE
This paper describes a new variational method for estimating disparity from stereo images. The stereo matching problem is formulated as a convex programming problem in which an ob...
ICRA
2010
IEEE
13 years 6 months ago
2010
IEEE
— Contact dynamics are commonly formulated as a linear complementarity problem. While this approach is superior to earlier spring-damper models, it can be inaccurate due to pyram...