8669 search results - page 414 / 1734 » Computing matrix representations |
187
click to vote
SPAA
2005
ACM
16 years 13 days ago
2005
ACM
In 1995, Gremban, Miller, and Zagha introduced supporttree preconditioners and a parallel algorithm called supporttree conjugate gradient (STCG) for solving linear systems of the ...
175
click to vote
ICALP
2004
Springer
16 years 8 days ago
2004
Springer
Abstract. In this paper we consider the problem of computing a minimum cycle basis in a graph G with m edges and n vertices. The edges of G have non-negative weights on them. The p...
182
click to vote
CSE
2009
IEEE
15 years 10 months ago
2009
IEEE
Sparse Matrix-Vector multiplication (SpMV) is a very challenging computational kernel, since its performance depends greatly on both the input matrix and the underlying architectur...
174
click to vote
IJCV
1998
15 years 6 months ago
1998
The structure-from-motion problem has been extensively studied in the field of computer vision. Yet, the bulk of the existing work assumes that the scene contains only a single mo...
204
click to vote
PAMI
2011
15 years 1 months ago
2011
Spectral clustering algorithms have been shown to be more effective in finding clusters than some traditional algorithms such as k-means. However, spectral clustering suffers fro...