Sciweavers

441 search results - page 31 / 89
» Sparse Recovery Using Sparse Random Matrices
Sort
View
LATIN
2010
Springer
15 years 4 months ago
The I/O Complexity of Sparse Matrix Dense Matrix Multiplication
We consider the multiplication of a sparse N × N matrix A with a dense N × N matrix B in the I/O model. We determine the worst-case non-uniform complexity of this task up to a c...
Gero Greiner, Riko Jacob
AAAI
2010
14 years 10 months ago
Multi-Task Sparse Discriminant Analysis (MtSDA) with Overlapping Categories
Multi-task learning aims at combining information across tasks to boost prediction performance, especially when the number of training samples is small and the number of predictor...
Yahong Han, Fei Wu, Jinzhu Jia, Yueting Zhuang, Bi...
SIAMSC
2010
210views more  SIAMSC 2010»
14 years 4 months ago
On Two-Dimensional Sparse Matrix Partitioning: Models, Methods, and a Recipe
We consider two-dimensional partitioning of general sparse matrices for parallel sparse matrix-vector multiply operation. We present three hypergraph-partitioning-based methods, ea...
Ümit V. Çatalyürek, Cevdet Aykana...
STOC
2010
ACM
220views Algorithms» more  STOC 2010»
15 years 1 months ago
Combinatorial approach to the interpolation method and scaling limits in sparse random graphs
We establish the existence of free energy limits for several sparse random hypergraph models corresponding to certain combinatorial models on Erd¨os-R´enyi graph G(N, c/N) and r...
Mohsen Bayati, David Gamarnik, Prasad Tetali
HPCC
2007
Springer
15 years 1 months ago
Concurrent Number Cruncher: An Efficient Sparse Linear Solver on the GPU
A wide class of geometry processing and PDE resolution methods needs to solve a linear system, where the non-zero pattern of the matrix is dictated by the connectivity matrix of th...
Luc Buatois, Guillaume Caumon, Bruno Lévy