17 search results - page 2 / 4 » Minimizing the Condition Number of a Gram Matrix |
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Compressive sensing predicts that sufficiently sparse vectors can be recovered from highly incomplete information. Efficient recovery methods such as 1-minimization find the sparse...
PAMI
2010
13 years 3 months ago
2010
—This work introduces a link-based covariance measure between the nodes of a weighted directed graph where a cost is associated to each arc. To this end, a probability distributi...
IJIT
2004
13 years 6 months ago
2004
Minimization methods for training feed-forward networks with Backpropagation are compared. Feedforward network training is a special case of functional minimization, where no expli...
SIAMCO
2002
13 years 4 months ago
2002
In this paper we develop and present new convex synthesis conditions for robust performance in linear time-varying systems, subject to time-varying perturbations. In particular, th...
FOCS
2007
IEEE
13 years 11 months ago
2007
IEEE
In this paper, we resolve the smoothed and approximative complexity of low-rank quasi-concave minimization, providing both upper and lower bounds. As an upper bound, we provide th...