561 search results - page 33 / 113 » Algorithms and applications for approximate nonnegative matr... |
COCO
2009
Springer
14 years 2 months ago
2009
Springer
One of the strongest techniques available for showing lower bounds on quantum communication complexity is the logarithm of the approximation rank of the communication matrix— th...
SIGIR
2008
ACM
13 years 7 months ago
2008
ACM
We introduce the posterior probabilistic clustering (PPC), which provides a rigorous posterior probability interpretation for Nonnegative Matrix Factorization (NMF) and removes th...
CVPR
2001
IEEE
14 years 9 months ago
2001
IEEE
This paper describes a face detection approach via learning local features. The key idea is that local features, being manifested by a collection of pixels in a local region, are ...
ICPR
2002
IEEE
14 years 8 months ago
2002
IEEE
We present a fast non-iterative method for approximating the leading eigenvector so as to render graph-spectral based grouping algorithms more efficient. The approximation is base...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
Many works on speech processing have dealt with auto-regressive (AR) models for spectral envelope and formant frequency estimation, mostly focusing on the estimation of the AR par...