FPL
2005
Springer
13 years 10 months ago
2005
Springer
An architecture and implementation of a high performance Gaussian random number generator (GRNG) is described. The GRNG uses the Ziggurat algorithm which divides the area under th...
EMSOFT
2005
Springer
13 years 10 months ago
2005
Springer
Interrupt-driven embedded software is hard to thoroughly test since it usually contains a very large number of executable paths. Developers can test more of these paths using rand...
INFOCOM
2005
IEEE
13 years 10 months ago
2005
IEEE
Abstract— Existing random membership management algorithms provide each node with a small, uniformly random subset of global participants. However, many applications would beneï¬...
IPPS
2006
IEEE
13 years 10 months ago
2006
IEEE
In many distributed computing systems that are prone to either induced or spontaneous node failures, the number of available computing resources is dynamically changing in a rando...
ICDCS
2007
IEEE
13 years 11 months ago
2007
IEEE
Uniform random sample is often useful in analyzing data. Usually taking a uniform sample is not a problem if the entire data resides in one location. However, if the data is distr...
FOCS
2008
IEEE
13 years 11 months ago
2008
IEEE
A merger is a probabilistic procedure which extracts the randomness out of any (arbitrarily correlated) set of random variables, as long as one of them is uniform. Our main result...
CIE
2009
Springer
13 years 11 months ago
2009
Springer
It is shown that from two strings that are partially random and independent (in the sense of Kolmogorov complexity) it is possible to effectively construct polynomially many strin...