44 search results - page 7 / 9 » On convex relaxations of quadrilinear terms |
ISPD
1997
ACM
14 years 1 days ago
1997
ACM
The wire sizing problem under inequality Elmore delay constraints is known to be posynomial, hence convex under an exponential variable-transformation. There are formal methods fo...
CVPR
2007
IEEE
14 years 10 months ago
2007
IEEE
We propose a linear programming relaxation scheme for the class of multiple object tracking problems where the inter-object interaction metric is convex and the intraobject term q...
ISBI
2002
IEEE
14 years 8 months ago
2002
IEEE
We investigate a new, fast and provably convergentMAP reconstruction algorithm for emission tomography. The new algorithm, termed C-OSEM has its origin in the alternating algorith...
NIPS
2004
13 years 9 months ago
2004
We propose a new method for clustering based on finding maximum margin hyperplanes through data. By reformulating the problem in terms of the implied equivalence relation matrix, ...
ICML
2010
IEEE
13 years 9 months ago
2010
IEEE
A sparse representation of Support Vector Machines (SVMs) with respect to input features is desirable for many applications. In this paper, by introducing a 0-1 control variable t...