Sciweavers

15 search results - page 2 / 3
» On sampling-based approximate spectral decomposition
Sort
View
ICASSP
2009
IEEE
14 years 9 days ago
Exploring functional connectivity in fMRI via clustering
In this paper we investigate the use of data driven clustering methods for functional connectivity analysis in fMRI. In particular, we consider the K-Means and Spectral Clustering...
Archana Venkataraman, Koene R. A. Van Dijk, Randy ...
NIPS
2004
13 years 7 months ago
Hierarchical Eigensolver for Transition Matrices in Spectral Methods
We show how to build hierarchical, reduced-rank representation for large stochastic matrices and use this representation to design an efficient algorithm for computing the largest...
Chakra Chennubhotla, Allan D. Jepson
GECCO
2005
Springer
186views Optimization» more  GECCO 2005»
13 years 11 months ago
Subproblem optimization by gene correlation with singular value decomposition
Several ways of using singular value decomposition (SVD), a linear algebra technique typically used for information retrieval, to decompose problems into subproblems are investiga...
Jacob G. Martin
TASLP
2002
120views more  TASLP 2002»
13 years 5 months ago
Improved audio coding using a psychoacoustic model based on a cochlear filter bank
Perceptual audio coders use an estimated masked threshold for the determination of the maximum permissible just-inaudible noise level introduced by quantization. This estimate is d...
Frank Baumgarte
SIAMMAX
2011
157views more  SIAMMAX 2011»
12 years 8 months ago
Deflated Restarting for Matrix Functions
We investigate an acceleration technique for restarted Krylov subspace methods for computing the action of a function of a large sparse matrix on a vector. Its effect is to ultima...
Michael Eiermann, Oliver G. Ernst, Stefan Güt...