72 search results - page 9 / 15 » Approximating Semidefinite Packing Programs |
117
click to vote
SIAMJO
2008
15 years 4 months ago
2008
We show that the optimal complexity of Nesterov's smooth first-order optimization algorithm is preserved when the gradient is only computed up to a small, uniformly bounded er...
132
click to vote
ICASSP
2011
IEEE
14 years 8 months ago
2011
IEEE
This paper considers the problem of low complexity implementation of high-performance semidefinite relaxation (SDR) MIMO detection methods. Currently, most SDR MIMO detectors are...
145
click to vote
SODA
2010
ACM
16 years 1 months ago
2010
ACM
The class of constraint satisfactions problems (CSPs) captures many fundamental combinatorial optimization problems such as Max Cut, Max q-Cut, Unique Games, and Max k-Sat. Recent...
132
click to vote
CVPR
2004
IEEE
16 years 6 months ago
2004
IEEE
Given a set of patterns and a similarity measure between them, we will present an optimization framework to approximate a small subset, known as a canonical set, whose members clo...
156
click to vote
CVPR
2006
IEEE
16 years 6 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...