187 search results - page 7 / 38 » Generic Graph Algorithms for Sparse Matrix Ordering |
167
Voted
JAL
2006
15 years 5 months ago
2006
We present a new algorithm, called LB-Triang, which computes minimal triangulations. We give both a straightforward O(nm0) time implementation and a more involved O(nm) time imple...
158
Voted
AC
2008
Springer
15 years 6 months ago
2008
Springer
Sparse matrices are first class objects in many VHLLs (very high level languages) used for scientific computing. They are a basic building block for various numerical and combinat...
159
click to vote
ICRA
2005
IEEE
15 years 11 months ago
2005
IEEE
— This paper presents the novel insight that the SLAM information matrix is exactly sparse in a delayedstate framework. Such a framework is used in view-based representations of ...
191
Voted
FCT
2003
Springer
15 years 11 months ago
2003
Springer
The bandwidth minimization problem has a long history and a number of practical applications. In this paper we introduce a natural extension of bandwidth to partially ordered layo...
180
click to vote
KDD
2008
ACM
16 years 6 months ago
2008
ACM
Low-rank approximations of the adjacency matrix of a graph are essential in finding patterns (such as communities) and detecting anomalies. Additionally, it is desirable to track ...