Sciweavers

329 search results - page 21 / 66
» Uniform variable splitting
Sort
View
TIT
2010
144views Education» more  TIT 2010»
14 years 11 months ago
Generalized and doubly generalized LDPC codes with random component codes for the binary erasure channel
In this paper, a method for the asymptotic analysis of generalized low-density parity-check (GLDPC) codes and doubly generalized low-density parity-check (D-GLDPC) codes over the b...
Enrico Paolini, Marc P. C. Fossorier, Marco Chiani
BIRTHDAY
2009
Springer
15 years 12 months ago
No i-Sums for Nissim (and Shalom)
Lappin and Francez (1994) present a theory of donkey anaphora which, they claim, captures both their existential and their universal readings, while maintaining a uniform represent...
Itamar Francez
155
Voted
ESOP
2006
Springer
15 years 8 months ago
Pure Pattern Calculus
Abstract. The pure pattern calculus generalises the pure lambda-calculus by basing computation on pattern-matching instead of beta-reduction. The simplicity and power of the calcul...
C. Barry Jay, Delia Kesner
ICALP
2009
Springer
15 years 12 months ago
A Better Algorithm for Random k-SAT
Let Φ be a uniformly distributed random k-SAT formula with n variables and m clauses. We present a polynomial time algorithm that finds a satisfying assignment of Φ with high p...
Amin Coja-Oghlan
136
Voted
AAAI
1996
15 years 6 months ago
Neighborhood Inverse Consistency Preprocessing
Constraint satisfaction consistency preprocessing methods are used to reduce search e ort. Time and especially space costs limit the amount of preprocessing that will be cost e ec...
Eugene C. Freuder, Charles D. Elfe