Sciweavers

573 search results - page 7 / 115
» On Wiedemann's Method of Solving Sparse Linear Systems
Sort
View
ISBI
2008
IEEE
14 years 8 months ago
Inferring brain dynamics using granger causality on fMRI data
Here we present a scalable method to compute the structure of causal links over large scale dynamical systems that achieves high efficiency in discovering actual functional connec...
Guillermo A. Cecchi, Rahul Garg, A. Ravishankar Ra...
ICPR
2010
IEEE
14 years 1 months ago
Sparse Coding of Linear Dynamical Systems with an Application to Dynamic Texture Recognition
Given a sequence of observable features of a linear dynamical system (LDS), we propose the problem of finding a representation of the LDS which is sparse in terms of a given dict...
Bernard Ghanem, Narendra Ahuja
EUROPAR
2004
Springer
14 years 1 months ago
Load and Memory Balanced Mesh Partitioning for a Parallel Envelope Method
Abstract. We use a parallel direct solver based on the Schur complement method for solving large sparse linear systems arising from the finite element method. A domain decompositi...
Ondrej Medek, Pavel Tvrdík, Jaroslav Kruis
PC
2002
118views Management» more  PC 2002»
13 years 7 months ago
Parallel algorithms for indefinite linear systems
Saddle-point problems give rise to indefinite linear systems that are challenging to solve via iterative methods. This paper surveys two recent techniques for solving such problem...
Ahmed H. Sameh, Vivek Sarin
ICASSP
2009
IEEE
13 years 11 months ago
Detection of sparse signals under finite-alphabet constraints
In this paper, we solve the problem of detecting the entries of a sparse finite-alphabet signal from a limited amount of data, for instance obtained by compressive sampling. While...
Zhi Tian, Geert Leus, Vincenzo Lottici