48 search results - page 2 / 10 » Exploiting semidefinite relaxations in constraint programmin... |
71
Voted
CORR
2010
Springer
14 years 9 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 ...
87
Voted
OL
2011
14 years 10 days ago
2011
In this paper we present a methodology for finding tight convex relaxations for a special set of quadratic constraints given by bilinear and linear terms that frequently arise in ...
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
We consider the robust beamforming problem under imperfect channel state information (CSI) subject to SINR constraints in a downlink multiuser MISO system. One popular approach to...
ACML
2009
Springer
15 years 1 months ago
2009
Springer
In this paper, we present a novel semidefinite programming approach for multiple-instance learning. We first formulate the multipleinstance learning as a combinatorial maximum marg...
SODA
2010
ACM
15 years 6 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...