461 search results - page 12 / 93 » Higher Kurtz randomness |
COMBINATORICS
2000
14 years 9 months ago
2000
It is shown in this note that with high probability it is enough to destroy all triangles in order to get a cover graph from a random graph Gn,p with p log n/n for any constant ...
PDCAT
2007
Springer
15 years 3 months ago
2007
Springer
ct There have been many previous attempts to accelerate MT19937 using FPGAs but we believe that we can substantially improve the previous implementations to develop a higher throug...
CHES
2010
Springer
14 years 10 months ago
2010
Springer
Random delays are often inserted in embedded software to protect against side-channel and fault attacks. At CHES 2009 a new method for generation of random delays was described tha...
TIT
2008
14 years 9 months ago
2008
This paper gives an information theoretic approach for detecting Byzantine modifications in networks employing random linear network coding. Each exogenous source packet is augmen...
GLOBECOM
2009
IEEE
15 years 4 months ago
2009
IEEE
—We investigate distributed channel-aware random access for networks with arbitrary topologies and traffic distributions, where users can receive traffic from or send traffic ...