Sciweavers

4714 search results - page 79 / 943
» The Complexity of Iterated Multiplication
Sort
View
ICASSP
2011
IEEE
14 years 1 months ago
Sparsity-undersampling tradeoff of compressed sensing in the complex domain
In this paper, recently developed ONE-L1 algorithms for compressed sensing are applied to complex-valued signals and sampling matrices. The optimal and iterative solution of ONE-L...
Zai Yang, Cishen Zhang
VLSISP
2010
140views more  VLSISP 2010»
14 years 8 months ago
A Split-Decoding Message Passing Algorithm for Low Density Parity Check Decoders
A Split decoding algorithm is proposed which divides each row of the parity check matrix into two or multiple nearly-independent simplified partitions. The proposed method signific...
Tinoosh Mohsenin, Bevan M. Baas
ICONIP
2010
14 years 8 months ago
Complex Spiking Models: A Role for Diffuse Thalamic Projections in Complex Cortical Activity
Cortical activity exhibits complex, persistent self-sustained dynamics, which is hypothesised to support the brain’s sophisticated processing capabilities. Prior studies have sho...
Peter Stratton, Janet Wiles
RECOMB
2009
Springer
15 years 4 months ago
Reconstructing Histories of Complex Gene Clusters on a Phylogeny
Abstract. Clusters of genes that have evolved by repeated segmental duplication present difficult challenges throughout genomic analysis, from sequence assembly to functional analy...
Tomás Vinar, Brona Brejová, Giltae S...
PARLE
1994
15 years 1 months ago
Run-Time Optimization of Sparse Matrix-Vector Multiplication on SIMD Machines
Sparse matrix-vector multiplication forms the heart of iterative linear solvers used widely in scientific computations (e.g., finite element methods). In such solvers, the matrix-v...
Louis H. Ziantz, Can C. Özturan, Boleslaw K. ...