177 search results - page 19 / 36 » Semidefinite Programming Relaxations for the Quadratic Assig... |
SODA
2001
ACM
13 years 10 months ago
2001
ACM
In the 0-extension problem, we are given a weighted graph with some nodes marked as terminals and a semimetric on the set of terminals. Our goal is to assign the rest of the nodes ...
SIAMJO
2010
13 years 3 months ago
2010
We consider a recently proposed optimization formulation of multi-task learning based on trace norm regularized least squares. While this problem may be formulated as a semidefini...
ATMOS
2007
13 years 10 months ago
2007
In this paper we study a general formulation of the train platforming problem, which contains as special cases all the versions previously considered in the literature as well as a...
COR
2007
13 years 9 months ago
2007
This paper considers the design of two-layered fully interconnected networks.A two-layered network consists of clusters of nodes, each defining an access network and a backbone n...
NN
2000
Springer
13 years 9 months ago
2000
Springer
Linear projection equations arise in many optimization problems and have important applications in science and engineering. In this paper, we present a recurrent neural network fo...