Sciweavers

230 search results - page 6 / 46
» A Random Bit Generator Using Chaotic Maps
Sort
View
IACR
2011
113views more  IACR 2011»
12 years 7 months ago
KISS: A Bit Too Simple
KISS (‘Keep it Simple Stupid’) is an efficient pseudo-random number generator originally specified by G. Marsaglia and A. Zaman in 1993. G. Marsaglia in 1998 posted a C versio...
Greg Rose
STACS
2012
Springer
12 years 3 months ago
Low Randomness Rumor Spreading via Hashing
We consider the classical rumor spreading problem, where a piece of information must be disseminated from a single node to all n nodes of a given network. We devise two simple pus...
George Giakkoupis, Thomas Sauerwald, He Sun, Phili...
SPAA
2010
ACM
13 years 8 months ago
On the bit communication complexity of randomized rumor spreading
We study the communication complexity of rumor spreading in the random phone-call model. Suppose n players communicate in parallel rounds, where in each round every player calls a...
Pierre Fraigniaud, George Giakkoupis
ECCC
1998
80views more  ECCC 1998»
13 years 7 months ago
Extracting All the Randomness from a Weakly Random Source
In this paper, we give two explicit constructions of extractors, both of which work for a source of any min-entropy on strings of length n. The rst extracts any constant fraction ...
Salil P. Vadhan
ICTAI
2005
IEEE
14 years 1 months ago
Hybrid Learning Neuro-Fuzzy Approach for Complex Modeling Using Asymmetric Fuzzy Sets
A hybrid learning neuro-fuzzy system with asymmetric fuzzy sets (HLNFS-A) is proposed in this paper. The learning methods of random optimization (RO) and least square estimation (...
Chunshien Li, Kuo-Hsiang Cheng, Jiann-Der Lee