Sciweavers

18 search results - page 2 / 4
» Co-clustering by block value decomposition
Sort
View
NA
2006
123views more  NA 2006»
13 years 7 months ago
Restarted block Lanczos bidiagonalization methods
Abstract. The problem of computing a few of the largest or smallest singular values and associated singular vectors of a large matrix arises in many applications. This paper descri...
James Baglama, Lothar Reichel
HPCC
2007
Springer
14 years 1 months ago
A Block JRS Algorithm for Highly Parallel Computation of SVDs
This paper presents a new algorithm for computing the singular value decomposition (SVD) on multilevel memory hierarchy architectures. This algorithm is based on one-sided JRS iter...
Mostafa I. Soliman, Sanguthevar Rajasekaran, Reda ...
VTC
2008
IEEE
162views Communications» more  VTC 2008»
14 years 1 months ago
A Novel Blind Channel Estimation Algorithm for a MIMO System
—In this paper, a novel blind channel estimation algorithm for a multiple input multiple output (MIMO) system is described. This algorithm is easier to implement than the previou...
Xia Liu, Marek E. Bialkowski, Shiyang Lu, Hon Tat ...
SDM
2011
SIAM
218views Data Mining» more  SDM 2011»
12 years 10 months ago
Segmented nestedness in binary data
A binary matrix is fully nested if its columns form a chain of subsets; that is, any two columns are ordered by the subset relation, where we view each column as a subset of the r...
Esa Junttila, Petteri Kaski
KDD
2012
ACM
212views Data Mining» more  KDD 2012»
11 years 10 months ago
Fast bregman divergence NMF using taylor expansion and coordinate descent
Non-negative matrix factorization (NMF) provides a lower rank approximation of a matrix. Due to nonnegativity imposed on the factors, it gives a latent structure that is often mor...
Liangda Li, Guy Lebanon, Haesun Park