177 search results - page 10 / 36 » Semidefinite Programming Relaxations for the Quadratic Assig... |
CORR
2010
Springer
13 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 ...
ICASSP
2011
IEEE
13 years 28 days 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...
KDD
2007
ACM
14 years 9 months ago
2007
ACM
The kernel function plays a central role in kernel methods. In this paper, we consider the automated learning of the kernel matrix over a convex combination of pre-specified kerne...
CVPR
2010
IEEE
14 years 2 months ago
2010
IEEE
We examine the shape from shading problem without boundary conditions as a polynomial system. This view allows, in generic cases, a complete solution for ideal polyhedral objects....
ICASSP
2011
IEEE
13 years 28 days ago
2011
IEEE
A sequential quadratic programming (SQP) method is proposed to solve the distributed beamforming problem in multiple relay networks. The problem is formulated as the minimization ...