98 search results - page 5 / 20 » Bounding Recursive Procedural Models Using Convex Optimizati... |
IOR
2011
13 years 2 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...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
Abstract— We develop a general framework for MAP estimation in discrete and Gaussian graphical models using Lagrangian relaxation techniques. The key idea is to reformulate an in...
SCIA
2009
Springer
14 years 1 months ago
2009
Springer
Many computer vision problems can be formulated as low rank bilinear minimization problems. One reason for the success of these problems is that they can be efficiently solved usin...
PATMOS
2005
Springer
14 years 25 days ago
2005
Springer
Early circuit performance estimation and easy-to-apply methods for minimum-delay gate sizing are needed, in order to enhance circuit’s performance and to increase designers’ pr...
CCE
2004
13 years 7 months ago
2004
This paper presents some new concepts and procedures for financial risk management. To complement the use of value at risk a new concept, upside potential or opportunity value as ...