187 search results - page 2 / 38 » Generic Graph Algorithms for Sparse Matrix Ordering |
APIN
2005
13 years 10 months ago
2005
In the direct solution of sparse symmetric and positive definite linear systems, finding an ordering of the matrix to minimize the height 1
APVIS
2007
14 years 6 days ago
2007
In this study, we examine the use of graph ordering algorithms for visual analysis of data sets using visual similarity matrices. Visual similarity matrices display the relationsh...
TKDE
2012
12 years 1 months ago
2012
— This paper presents a method for identifying a set of dense subgraphs of a given sparse graph. Within the main applications of this “dense subgraph problem”, the dense subg...
ICASSP
2010
IEEE
13 years 11 months ago
2010
IEEE
Recently, the Sparse Matrix Transform (SMT) has been proposed as a tool for estimating the eigen-decomposition of high dimensional data vectors [1]. The SMT approach has two major...
IPPS
2000
IEEE
14 years 3 months ago
2000
IEEE
Abstract. Computer simulations of realistic applications usually require solving a set of non-linear partial di erential equations PDEs over a nite region. The process of obtaini...