401 search results - page 32 / 81 » Sparse Quasi-Random Graphs |
CORR
2010
Springer
13 years 6 months ago
2010
Springer
Gaussian graphical models are of great interest in statistical learning. Because the conditional independencies between different nodes correspond to zero entries in the inverse c...
ICPP
1999
IEEE
14 years 3 days ago
1999
IEEE
In this paper, we present the index-permutation (IP) graph model, and apply it to the systematic development of efficient hierarchical networks. We derive several classes of inter...
EUROPAR
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. We use a parallel direct solver based on the Schur complement method for solving large sparse linear systems arising from the finite element method. A domain decompositi...
IPPS
2002
IEEE
14 years 22 days ago
2002
IEEE
In this paper, we propose a new distributed algorithm that constructs a sparse spanner subgraph of the unit disk graph efficiently for wireless ad hoc networks. It maintains a li...
DSD
2010
IEEE
13 years 8 months ago
2010
IEEE
—This paper presents an approximate Maximum Common Subgraph (MCS) algorithm, specifically for directed, cyclic graphs representing digital circuits. Because of the application d...