1105 search results - page 49 / 221 » Linear choosability of graphs |
118
click to vote
HIPC
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. Linear scan register allocation is an attractive register allocation algorithm because of its simplicity and fast running time. However, it is generally felt that linear ...
CORR
2004
Springer
14 years 11 months ago
2004
Springer
We consider linear systems arising from the use of the finite element method for solving a certain class of linear elliptic problems. Our main result is that these linear systems, ...
WADS
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. In this paper we consider a generalization of the edge dominating set (EDS) problem, in which each edge e needs to be covered be times and refer to this as the b-EDS prob...
PVM
1997
Springer
15 years 4 months ago
1997
Springer
The traditional approach to the parallelization of linear algebra algorithms such as matrix multiplication and LU factorization calls for static allocation of matrix blocks to proc...
CORR
2007
Springer
14 years 12 months ago
2007
Springer
Abstract—We initiate the probabilistic analysis of linear programming (LP) decoding of low-density parity-check (LDPC) codes. Specifically, we show that for a random LDPC code e...