560 search results - page 39 / 112 » Level-set methods for convex optimization |
124
Voted
ICML
2008
IEEE
16 years 4 months ago
2008
IEEE
The problem of obtaining the maximum a posteriori (map) estimate of a discrete random field is of fundamental importance in many areas of Computer Science. In this work, we build ...
128
click to vote
ICML
2005
IEEE
16 years 4 months ago
2005
IEEE
This paper presents an algorithm to estimate simultaneously both mean and variance of a non parametric regression problem. The key point is that we are able to estimate variance l...
167
click to vote
IOR
2011
14 years 10 months ago
2011
In this paper, we give a finite disjunctive programming procedure to obtain the convex hull of general mixed-integer linear programs (MILP) with bounded integer variables. We prop...
101
Voted
NIPS
2007
15 years 4 months ago
2007
Hierarchical penalization is a generic framework for incorporating prior information in the fitting of statistical models, when the explicative variables are organized in a hiera...
166
Voted
SIAMIS
2011
14 years 10 months ago
2011
Abstract. Accurate signal recovery or image reconstruction from indirect and possibly undersampled data is a topic of considerable interest; for example, the literature in the rece...