187 search results - page 6 / 38 » Generic Graph Algorithms for Sparse Matrix Ordering |
NAA
2000
Springer
15 years 3 months ago
2000
Springer
We describe the implementation and performance of a novel fill-minimization ordering technique for sparse LU factorization with partial pivoting. The technique was proposed by Gilb...
158
click to vote
CVPR
2009
IEEE
16 years 7 months ago
2009
IEEE
This paper addresses the problem of establishing correspondences
between two sets of visual features using
higher-order constraints instead of the unary or pairwise
ones used in...
111
click to vote
CIKM
2010
Springer
14 years 10 months ago
2010
Springer
In Latent Semantic Indexing (LSI), a collection of documents is often pre-processed to form a sparse term-document matrix, followed by a computation of a low-rank approximation to...
ECOOPW
1998
Springer
15 years 4 months ago
1998
Springer
Abstract. We present a uni ed approach for expressing high performance numerical linear algebra routines for a class of dense and sparse matrix formats and shapes. As with the Stan...
COMBINATORICS
1998
14 years 11 months ago
1998
A circulant graph G of order n is a Cayley graph over the cyclic group Zn. Equivalently, G is circulant iff its vertices can be ordered such that the corresponding adjacency matr...