Sciweavers

477 search results - page 50 / 96
» Algorithms for Non-negative Matrix Factorization
Sort
View
ICASSP
2009
IEEE
14 years 3 months ago
Robust speech dereverberation based on non-negativity and sparse nature of speech spectrograms
This paper presents a blind dereverberation method designed to recover the subband envelope of an original speech signal from its reverberant version. The problem is formulated as...
Hirokazu Kameoka, Tomohiro Nakatani, Takuya Yoshio...
ECCV
2008
Springer
13 years 10 months ago
Discriminative Locality Alignment
—This paper presents a fast part-based subspace selection algorithm, termed the binary sparse nonnegative matrix factorization (B-SNMF). Both the training process and the testing...
Tianhao Zhang, Dacheng Tao, Jie Yang
JISE
2006
85views more  JISE 2006»
13 years 9 months ago
A Programming Methodology for Designing Block Recursive Algorithms
In this paper, we use the tensor product notation as the framework of a programming methodology for designing block recursive algorithms. We first express a computational problem ...
Min-Hsuan Fan, Chua-Huang Huang, Yeh-Ching Chung, ...
ISSAC
1997
Springer
105views Mathematics» more  ISSAC 1997»
14 years 1 months ago
On Randomized Lanczos Algorithms
Las Vegas algorithms that are based on Lanczos’s method for solving symmetric linear systems are presented and analyzed. These are compared to a similar randomized Lanczos algor...
Wayne Eberly, Erich Kaltofen
SIAMSC
2008
123views more  SIAMSC 2008»
13 years 9 months ago
Balanced Incomplete Factorization
In this paper we present a new incomplete factorization of a square matrix into triangular factors in which we get standard LU or LDLT factors (direct factors) and their inverses (...
Rafael Bru, José Marín, José ...