560 search results - page 86 / 112 » Level-set methods for convex optimization |
157
click to vote
DAGM
2008
Springer
15 years 5 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...
109
Voted
NIPS
2007
15 years 5 months ago
2007
It is becoming increasingly important to learn from a partially-observed random matrix and predict its missing elements. We assume that the entire matrix is a single sample drawn ...
120
Voted
AUTOMATICA
2004
15 years 3 months ago
2004
In this paper, we discuss semidefinite relaxation techniques for computing minimal size ellipsoids that bound the solution set of a system of uncertain linear equations. The propo...
132
Voted
EMNLP
2010
15 years 1 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...
146
Voted
ACCV
2010
Springer
14 years 10 months ago
2010
Springer
We propose a novel variational formulation for generating 3D models of objects from a single view. Based on a few user scribbles in an image, the algorithm automatically extracts t...