177 search results - page 8 / 36 » Semidefinite Programming Relaxations for the Quadratic Assig... |
108
click to vote
ACML
2009
Springer
15 years 3 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...
109
click to vote
CORR
2010
Springer
14 years 11 months ago
2010
Springer
Recent years have seen an explosion of interest in lift and project methods, such as those proposed by Lov
108
click to vote
DIALM
2007
ACM
15 years 3 months ago
2007
ACM
We consider the following channel assignment problem in multiradio multi-channel wireless networks: Given a wireless network where k orthogonal channels are available and each nod...
114
click to vote
ICASSP
2011
IEEE
14 years 3 months ago
2011
IEEE
In the independent component analysis, polynomial functions of higher order statistics are often used as cost functions. However, such cost functions usually have many local minim...
110
click to vote
NIPS
2004
15 years 1 months ago
2004
We examine the problem of approximating, in the Frobenius-norm sense, a positive, semidefinite symmetric matrix by a rank-one matrix, with an upper bound on the cardinality of its...