740 search results - page 133 / 148 » Lower bounds for Buchsbaum* complexes |
142
click to vote
CORR
2006
Springer
15 years 5 months ago
2006
Springer
Abstract-- An elementary combinatorial Tanner graph construction for a family of near-regular low density parity check (LDPC) codes achieving high girth is presented. These codes a...
129
click to vote
CORR
2006
Springer
15 years 5 months ago
2006
Springer
We consider the multiple-access communication problem in a distributed setting for both the additive white Gaussian noise channel and the discrete memoryless channel. We propose a ...
172
click to vote
JPDC
2006
15 years 5 months ago
2006
We propose a framework for defining agent-based models (ABMs) and two algorithms for the automatic parallelization of agent-based models, a general version P-ABMG for all ABMs def...
145
click to vote
OL
2008
15 years 5 months ago
2008
By introducing redundant Klee-Minty examples, we have previously shown that the central path can be bent along the edges of the Klee-Minty cubes, thus having 2n - 2 sharp turns in...
155
click to vote
SIAMDM
2008
15 years 5 months ago
2008
Let G be a connected graph, and let V and V two n-element subsets of its vertex set V (G). Imagine that we place a chip at each element of V and we want to move them into the posi...