29 search results - page 3 / 6 » Fast Newton-type Methods for the Least Squares Nonnegative M... |
ICASSP
2008
IEEE
14 years 7 days ago
2008
IEEE
We propose a new algorithm for Approximate Joint Diagonalization (AJD) with two main advantages over existing state-of-the-art algorithms: Improved overall running speed, especial...
ICDM
2008
IEEE
14 years 6 days ago
2008
IEEE
Nonnegative Matrix Factorization (NMF) is a dimension reduction method that has been widely used for various tasks including text mining, pattern analysis, clustering, and cancer ...
AUTOMATICA
2008
13 years 5 months ago
2008
Fitting data by a bounded complexity linear model is equivalent to low-rank approximation of a matrix constructed from the data. The data matrix being Hankel structured is equival...
SODA
2008
ACM
13 years 7 months ago
2008
ACM
Approximation of the permanent of a matrix with nonnegative entries is a well studied problem. The most successful approach to date for general matrices uses Markov chains to appr...
SIAMJO
2011
13 years 22 days ago
2011
Abstract. The condition number of a Gram matrix defined by a polynomial basis and a set of points is often used to measure the sensitivity of the least squares polynomial approxim...