34 search results - page 1 / 7 » On the gap between the quadratic integer programming problem... |
MP
2006
13 years 10 months ago
2006
Consider the semidefinite relaxation (SDR) of the quadratic integer program (QIP): := maxx{-1,1}n xT Qx minD-Q 0 trace(D) =:
CVPR
2004
IEEE
15 years 26 days 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...
CORR
2010
Springer
13 years 11 months ago
2010
Springer
Grothendieck inequalities are fundamental inequalities which are frequently used in many areas of mathematics and computer science. They can be interpreted as upper bounds for the ...
SODA
2010
ACM
14 years 8 months ago
2010
ACM
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...
CORR
2010
Springer
13 years 11 months ago
2010
Springer
Abstract--In cognitive radio (CR) networks with multipleinput multiple-output (MIMO) links, secondary users (SUs) can exploit "spectrum holes" in the space domain to acce...