Sciweavers

416 search results - page 23 / 84
» Processing Textbook-Style Matrices
Sort
View
96
Voted
ISCIS
2003
Springer
15 years 5 months ago
Minimizing Communication Cost in Fine-Grain Partitioning of Sparse Matrices
Abstract. We show a two-phase approach for minimizing various communication-cost metrics in fine-grain partitioning of sparse matrices for parallel processing. In the first phase...
Bora Uçar, Cevdet Aykanat
ICASSP
2009
IEEE
15 years 7 months ago
Shrinkage estimation of high dimensional covariance matrices
We address covariance estimation under mean-squared loss in the Gaussian setting. Specifically, we consider shrinkage methods which are suitable for high dimensional problems wit...
Yilun Chen, Ami Wiesel, Alfred O. Hero
106
Voted
PPOPP
2003
ACM
15 years 5 months ago
Factorization with morton-ordered quadtree matrices for memory re-use and parallelism
Quadtree matrices using Morton-order storage provide natural blocking on every level of a memory hierarchy. Writing the natural recursive algorithms to take advantage of this bloc...
Jeremy D. Frens, David S. Wise
76
Voted
ACIVS
2006
Springer
15 years 6 months ago
Dilation Matrices for Nonseparable Bidimensional Wavelets
Abstract. For nonseparable bidimensional wavelet transforms, the choice of the dilation matrix is all–important, since it governs the downsampling and upsampling steps, determine...
Ana M. C. Ruedin
98
Voted
ICA
2004
Springer
15 years 5 months ago
Blind Source Separation of Linear Mixtures with Singular Matrices
We consider the Blind Source Separation problem of linear mixtures with singular matrices and show that it can be solved if the sources are sufficiently sparse. More generally, we ...
Pando G. Georgiev, Fabian J. Theis