Sciweavers

20 search results - page 3 / 4
» Fast signal analysis and decomposition on graphs using the S...
Sort
View
SADM
2008
178views more  SADM 2008»
13 years 5 months ago
Fast Projection-Based Methods for the Least Squares Nonnegative Matrix Approximation Problem
: Nonnegative matrix approximation (NNMA) is a popular matrix decomposition technique that has proven to be useful across a diverse variety of fields with applications ranging from...
Dongmin Kim, Suvrit Sra, Inderjit S. Dhillon
KDD
2008
ACM
165views Data Mining» more  KDD 2008»
14 years 6 months ago
Colibri: fast mining of large static and dynamic graphs
Low-rank approximations of the adjacency matrix of a graph are essential in finding patterns (such as communities) and detecting anomalies. Additionally, it is desirable to track ...
Hanghang Tong, Spiros Papadimitriou, Jimeng Sun, P...
JCNS
2010
90views more  JCNS 2010»
13 years 17 days ago
Fast Kalman filtering on quasilinear dendritic trees
Optimal filtering of noisy voltage signals on dendritic trees is a key problem in computational cellular neuroscience. However, the state variable in this problem -- the vector of...
Liam Paninski
CIKM
2010
Springer
13 years 3 months ago
Fast dimension reduction for document classification based on imprecise spectrum analysis
This paper proposes an algorithm called Imprecise Spectrum Analysis (ISA) to carry out fast dimension reduction for document classification. ISA is designed based on the one-sided...
Hu Guan, Bin Xiao, Jingyu Zhou, Minyi Guo, Tao Yan...
BMCBI
2010
154views more  BMCBI 2010»
13 years 3 months ago
Knowledge-based matrix factorization temporally resolves the cellular responses to IL-6 stimulation
Background: External stimulations of cells by hormones, cytokines or growth factors activate signal transduction pathways that subsequently induce a re-arrangement of cellular gen...
Andreas Kowarsch, Florian Blöchl, Sebastian B...