Sciweavers

598 search results - page 17 / 120
» The Structure of Sparse Resultant Matrices
Sort
View
ICVS
2003
Springer
14 years 1 months ago
A Spectral Approach to Learning Structural Variations in Graphs
This paper shows how to construct a linear deformable model for graph structure by performing principal components analysis (PCA) on the vectorised adjacency matrix. We commence b...
Bin Luo, Richard C. Wilson, Edwin R. Hancock
PC
2002
158views Management» more  PC 2002»
13 years 8 months ago
On parallel block algorithms for exact triangularizations
We present a new parallel algorithm to compute an exact triangularization of large square or rectangular and dense or sparse matrices in any field. Using fast matrix multiplicatio...
Jean-Guillaume Dumas, Jean-Louis Roch
AAECC
2007
Springer
111views Algorithms» more  AAECC 2007»
13 years 8 months ago
When cache blocking of sparse matrix vector multiply works and why
Abstract. We present new performance models and a new, more compact data structure for cache blocking when applied to the sparse matrixvector multiply (SpM×V) operation, y ← y +...
Rajesh Nishtala, Richard W. Vuduc, James Demmel, K...
CVPR
2012
IEEE
11 years 11 months ago
Geometry constrained sparse coding for single image super-resolution
The choice of the over-complete dictionary that sparsely represents data is of prime importance for sparse codingbased image super-resolution. Sparse coding is a typical unsupervi...
Xiaoqiang Lu, Haoliang Yuan, Pingkun Yan, Yuan Yua...
ICASSP
2011
IEEE
13 years 12 days ago
The Rotational Lasso
This paper presents a sparse approach of solving the onesided Procrustes problem with special orthogonal constraint. By leveraging a planar decomposition common to all rotation ma...
Alexander Lorbert, Peter J. Ramadge