44 search results - page 4 / 9 » On convex relaxations of quadrilinear terms |
CVPR
2006
IEEE
14 years 9 months ago
2006
IEEE
This paper presents a generic method for solving Markov random fields (MRF) by formulating the problem of MAP estimation as 0-1 quadratic programming (QP). Though in general solvi...
SIAMNUM
2010
13 years 1 months ago
2010
Infimizing sequences in nonconvex variational problems typically exhibit enforced finer and finer oscillations called microstructures such that the infimal energy is not attained. ...
CORR
2011
Springer
12 years 10 months ago
2011
Springer
We consider the problem of globally minimizing the sum of many rational functions over a given compact semialgebraic set. The number of terms can be large (10 to 100), the degree ...
STOC
2005
ACM
14 years 7 months ago
2005
ACM
We consider the classical problem of scheduling parallel unrelated machines. Each job is to be processed by exactly one machine. Processing job j on machine i requires time pij . ...
DAC
2005
ACM
13 years 9 months ago
2005
ACM
We present an efficient and accurate gate sizing tool that employs a novel piecewise convex delay model, handling both rise and fall delays, for static CMOS gates. The delay model...