44 search results - page 5 / 9 » On convex relaxations of quadrilinear terms |
TWC
2008
13 years 7 months ago
2008
Multiuser downlink beamforming under quality of service (QoS) constraints has attracted considerable interest in recent years, because it is particularly appealing from a network o...
ICCV
2011
IEEE
12 years 7 months ago
2011
IEEE
In geometric computer vision, the structure from motion (SfM) problem can be formulated as a optimization problem with a rank constraint. It is well known that the trace norm of a...
NIPS
2007
13 years 8 months ago
2007
We present a novel linear clustering framework (DIFFRAC) which relies on a linear discriminative cost function and a convex relaxation of a combinatorial optimization problem. The...
PAMI
2007
13 years 6 months ago
2007
—We present a novel convex programming scheme to solve matching problems, focusing on the challenging problem of matching in a large search range and with cluttered background. M...
NIPS
2007
13 years 8 months ago
2007
Stability is a desirable characteristic for linear dynamical systems, but it is often ignored by algorithms that learn these systems from data. We propose a novel method for learn...