Sciweavers

187 search results - page 21 / 38
» Generic Graph Algorithms for Sparse Matrix Ordering
Sort
View
JPDC
2008
110views more  JPDC 2008»
14 years 9 months ago
Parallel multilevel algorithms for hypergraph partitioning
In this paper, we present parallel multilevel algorithms for the hypergraph partitioning problem. In particular, we describe schemes for parallel coarsening, parallel greedy k-way...
Aleksandar Trifunovic, William J. Knottenbelt
TIT
2010
137views Education» more  TIT 2010»
14 years 4 months ago
Average case analysis of multichannel sparse recovery using convex relaxation
This paper considers recovery of jointly sparse multichannel signals from incomplete measurements. Several approaches have been developed to recover the unknown sparse vectors from...
Yonina C. Eldar, Holger Rauhut
64
Voted
IEEECIT
2007
IEEE
15 years 3 months ago
Overview of LDPC Codes
In light of the history of LDPC codes and relevant research advances in recent years, this paper probes into the encoding and decoding techniques related to this capacity-approach...
Zongjie Tu, Shiyong Zhang
CORR
2010
Springer
116views Education» more  CORR 2010»
14 years 9 months ago
Restricted Isometries for Partial Random Circulant Matrices
In the theory of compressed sensing, restricted isometry analysis has become a standard tool for studying how efficiently a measurement matrix acquires information about sparse an...
Holger Rauhut, Justin K. Romberg, Joel A. Tropp
PPOPP
1997
ACM
15 years 1 months ago
LoPC: Modeling Contention in Parallel Algorithms
Parallel algorithm designers need computational models that take first order system costs into account, but are also simple enough to use in practice. This paper introduces the L...
Matthew Frank, Anant Agarwal, Mary K. Vernon