811 search results - page 32 / 163 » Avoiding Approximate Squares |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Nonnegative Matrix Factorization (NMF) is the problem of approximating a nonnegative matrix with the product of two low-rank nonnegative matrices and has been shown to be particul...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
Abstract—We consider a certain class of large random matrices, composed of independent column vectors with zero mean and different covariance matrices, and derive asymptotically ...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
We propose a method to improve approximate inference methods by correcting for the influence of loops in the graphical model. The method is a generalization and alternative implem...
ICHIT
2009
Springer
14 years 2 months ago
2009
Springer
The stereo matching algorithms for binocular vision are very popular and widely applied. However, the algorithms may have lower matching quality or higher time complexity. To impr...
AUTOMATICA
2008
13 years 7 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...