Sciweavers

1203 search results - page 79 / 241
» Probabilistic Matrix Factorization
Sort
View
STOC
2005
ACM
139views Algorithms» more  STOC 2005»
16 years 6 months ago
Spectral norm of random matrices
We study the spectral norm of matrices M that can be factored as M = BA, where A is a random matrix with independent mean zero entries and B is a fixed matrix. Under the (4 + )-th ...
Van H. Vu
GRAPHICSINTERFACE
2003
15 years 7 months ago
Fast Extraction of BRDFs and Material Maps from Images
The high dimensionality of the BRDF makes it difficult to use measured data for hardware rendering. Common solutions to overcome this problem include expressing a BRDF as a sum o...
Rafal Jaroszkiewicz, Michael D. McCool
CORR
2010
Springer
61views Education» more  CORR 2010»
15 years 6 months ago
A weakly stable algorithm for general Toeplitz systems
We show that a fast algorithm for the QR factorization of a Toeplitz or Hankel matrix A is weakly stable in the sense that RT R is close to AT A. Thus, when the algorithm is used ...
Adam W. Bojanczyk, Richard P. Brent, Frank R. de H...
ICASSP
2011
IEEE
14 years 10 months ago
An iterative least-squares technique for dereverberation
Some recent dereverberation approaches that have been effective for automatic speech recognition (ASR) applications, model reverberation as a linear convolution operation in the s...
Kshitiz Kumar, Bhiksha Raj, Rita Singh, Richard M....
JSC
2010
155views more  JSC 2010»
15 years 4 months ago
Algorithms for solving linear systems over cyclotomic fields
We consider the problem of solving a linear system Ax = b over a cyclotomic field. What makes cyclotomic fields of special interest is that we can easily find a prime p that sp...
Liang Chen, Michael B. Monagan