761 search results - page 110 / 153 » Efficient Approximation Algorithms for the Subset-Sums Equal... |
128
click to vote
AAAI
2010
15 years 4 months ago
2010
Multi-instance learning deals with problems that treat bags of instances as training examples. In single-instance learning problems, dimensionality reduction is an essential step ...
121
Voted
IGARSS
2009
15 years 21 days ago
2009
Finding an accurate sparse approximation of a spectral vector described by a linear model, when there is available a library of possible constituent signals (called endmembers or ...
145
click to vote
ICCAD
1999
IEEE
15 years 7 months ago
1999
IEEE
The minimum rectilinear Steiner tree (RST) problem is one of the fundamental problems in the field of electronic design automation. The problem is NP-hard, and much work has been ...
164
click to vote
CORR
2011
Springer
14 years 6 months ago
2011
Springer
: The Bethe Permanent of a Non-Negative Matrix Pascal O. Vontobel HP Laboratories HPL-2011-116 Bethe approximation; Bethe permanent; graph cover; partition function; perfect ma...
122
click to vote
ICIP
1995
IEEE
15 years 6 months ago
1995
IEEE
We consider a general weighted least squares approximation problem with a membrane spline regularization term. The key parameters in this formulation are the weighting factors whi...