225 search results - page 12 / 45 » Approximating Parameterized Convex Optimization Problems |
CDC
2009
IEEE
14 years 1 months ago
2009
IEEE
— The moment problem matured from its various special forms in the late 19th and early 20th Centuries to a general class of problems that continues to exert profound influence o...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
We propose a convex-concave programming approach for the labeled weighted graph matching problem. The convex-concave programming formulation is obtained by rewriting the weighted ...
COLT
2006
Springer
14 years 7 days ago
2006
Springer
Abstract. In this paper we unify divergence minimization and statistical inference by means of convex duality. In the process of doing so, we prove that the dual of approximate max...
UAI
2003
13 years 10 months ago
2003
Loopy and generalized belief propagation are popular algorithms for approximate inference in Markov random fields and Bayesian networks. Fixed points of these algorithms correspo...
INFOCOM
2000
IEEE
14 years 27 days ago
2000
IEEE
Abstract—The future Internet is expected to support applications with quality of service (QoS) requirements. For this end several mechanisms are suggested in the IETF to support ...