105 search results - page 9 / 21 » On Semidefinite Programming Relaxations of the Traveling Sal... |
NIPS
2004
13 years 8 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...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. We introduce two min-max problems: the first problem is to minimize the supremum of finitely many rational functions over a compact basic semi-algebraic set whereas the s...
IRREGULAR
1997
Springer
13 years 11 months ago
1997
Springer
ing with shared data abstractions Simon Dobson1 and Don Goodeve2 1 Well-Founded Systems Unit, CLRC Rutherford Appleton Laboratory, UK 2 School of Computer Studies, University of Le...
ICASSP
2008
IEEE
14 years 1 months ago
2008
IEEE
We develop a computationally efficient and memory efficient approach to (near) maximum a posteriori probability demodulation for MIMO systems with QPSK signalling, based on semi...
CORR
2010
Springer
13 years 7 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 ...