36 search results - page 2 / 8 » Solving convex programs by random walks |
ICML
2008
IEEE
14 years 7 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 ...
CDC
2008
IEEE
13 years 8 months ago
2008
IEEE
In this paper, an input/output system identification technique for the Wiener-Hammerstein model and its feedback extension is proposed. In the proposed framework, the identificatio...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
Abstract--We consider the problem of recovering a lowrank matrix when some of its entries, whose locations are not known a priori, are corrupted by errors of arbitrarily large magn...
CP
2005
Springer
13 years 11 months ago
2005
Springer
This paper describes a hybrid approach to solving large-scale constraint satisfaction and optimization problems. It describes a hybrid algorithm for integer linear programming whic...
JMLR
2012
11 years 8 months ago
2012
We address the problem of finding the most likely assignment or MAP estimation in a Markov random field. We analyze the linear programming formulation of MAP through the lens of...