305 search results - page 24 / 61 » From Sets to Bits in Coq |
ICN
2005
Springer
15 years 4 months ago
2005
Springer
Spatially coordinated packet sampling can be implemented by using a deterministic function of packet content to determine the selection decision for a given packet. In this way, a...
77
Voted
STOC
2009
ACM
15 years 11 months ago
2009
ACM
We prove that for any positive integer k, there is a constant ck such that a randomly selected set of cknk log n Boolean vectors with high probability supports a balanced k-wise i...
104
click to vote
STOC
2005
ACM
15 years 11 months ago
2005
ACM
We investigate constructions of pseudorandom generators that fool polynomial tests of degree d in m variables over finite fields F. Our main construction gives a generator with se...
IEEEARES
2010
IEEE
15 years 5 months ago
2010
IEEE
- An operational complexity model (OCM) is proposed to enable the complexity of both the cognitive and the computational components of a process to be determined. From the complexi...
128
click to vote
ICC
2007
IEEE
15 years 5 months ago
2007
IEEE
Low-density parity-check codes using the beliefpropagation decoding algorithm tend to exhibit a high error floor in the bit error rate curves, when some problematic graphical stru...