1201 search results - page 124 / 241 » Linear Probing and Graphs |
126
click to vote
EUROPAR
2004
Springer
15 years 6 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...
115
click to vote
CAV
2003
Springer
15 years 6 months ago
2003
Springer
We show that the model checking problem for µ-calculus on graphs of bounded tree-width can be solved in time linear in the size of the system. The result is presented by first sh...
IPPS
2002
IEEE
15 years 5 months 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...
106
Voted
CC
2006
Springer
15 years 4 months ago
2006
Springer
As register allocation is one of the most important phases in optimizing compilers, much work has been done to improve its quality and speed. We present a novel register allocation...
FMCAD
2008
Springer
15 years 2 months ago
2008
Springer
Synchronous Data flow (SDF) graphs have a simple and elegant semantics (essentially linear algebra) which makes SDF graphs eminently suitable as a vehicle for studying scheduling o...