Sciweavers

1511 search results - page 19 / 303
» Randomness, lowness and degrees
Sort
View
85
Voted
GLOBECOM
2006
IEEE
15 years 5 months ago
Protograph LDPC Codes with Node Degrees at Least 3
— In this paper we present protograph codes with a small number of degree-3 nodes and one high degree node. The iterative decoding threshold for proposed rate 1/2 codes are lower...
Dariush Divsalar, Christopher Jones
SPAA
2009
ACM
16 years 9 days ago
Brief announcement: parameterized maximum and average degree approximation in topic-based publish-subscribe overlay network desi
Designing an overlay network for publish/subscribe communication in a system where nodes may subscribe to many different topics of interest is of fundamental importance. For scala...
Melih Onus, Andréa W. Richa
PODS
2006
ACM
156views Database» more  PODS 2006»
15 years 12 months ago
From statistical knowledge bases to degrees of belief: an overview
An intelligent agent will often be uncertain about various properties of its environment, and when acting in that environment it will frequently need to quantify its uncertainty. ...
Joseph Y. Halpern
FSE
2006
Springer
109views Cryptology» more  FSE 2006»
15 years 3 months ago
Computing the Algebraic Immunity Efficiently
The purpose of algebraic attacks on stream and block ciphers is to recover the secret key by solving an overdefined system of multivariate algebraic equations. They become very eff...
Frédéric Didier, Jean-Pierre Tillich
72
Voted
JSYML
2011
45views more  JSYML 2011»
14 years 6 months ago
On the jump classes of noncuppable enumeration degrees
We prove that for every Σ0 2 enumeration degree b there exists a noncuppable Σ0 2 degree a > 0e such that b ≤e a and a ≤e b . This allows us to deduce, from results on the...
Charles M. Harris