1201 search results - page 56 / 241 » Linear Probing and Graphs |
WADS
2005
Springer
15 years 6 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...
99
Voted
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...
88
Voted
CORR
2007
Springer
15 years 16 days 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...
162
Voted
LPAR
2007
Springer
15 years 6 months ago
2007
Springer
Proof nets are a parallel syntax for sequential proofs of linear logic, firstly introduced by Girard in 1987. Here we present and intrinsic (geometrical) characterization of proof...
102
click to vote
SIAMCOMP
2000
15 years 9 days ago
2000
The bipartite crossing number problem is studied, and a connection between this problem and the linear arrangement problem is established. It is shown that when the arboricity is ...