598 search results - page 17 / 120 » The Structure of Sparse Resultant Matrices |
112
click to vote
ICVS
2003
Springer
15 years 9 months ago
2003
Springer
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...
142
Voted
PC
2002
15 years 3 months ago
2002
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...
153
Voted
AAECC
2007
Springer
15 years 3 months ago
2007
Springer
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 +...
158
click to vote
CVPR
2012
IEEE
13 years 6 months ago
2012
IEEE
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...
116
Voted
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
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...