Sciweavers

721 search results - page 34 / 145
» On Generators of Random Quasigroup Problems
Sort
View
FOCS
2000
IEEE
14 years 11 days ago
The Randomness Recycler: A New Technique for Perfect Sampling
For many probability distributions of interest, it is quite difficult to obtain samples efficiently. Often, Markov chains are employed to obtain approximately random samples fro...
James Allen Fill, Mark Huber
CCS
2005
ACM
14 years 1 months ago
A model and architecture for pseudo-random generation with applications to /dev/random
We present a formal model and a simple architecture for robust pseudorandom generation that ensures resilience in the face of an observer with partial knowledge/control of the gen...
Boaz Barak, Shai Halevi
DAC
2005
ACM
14 years 9 months ago
StressTest: an automatic approach to test generation via activity monitors
The challenge of verifying a modern microprocessor design is an overwhelming one: Increasingly complex micro-architectures combined with heavy time-to-market pressure have forced ...
Ilya Wagner, Valeria Bertacco, Todd M. Austin
AE
2001
Springer
14 years 14 days ago
Markov Random Field Modelling of Royal Road Genetic Algorithms
Abstract. Markov Random Fields (MRFs) 5] are a class of probabalistic models that have been applied for many years to the analysis of visual patterns or textures. In this paper, ou...
Deryck F. Brown, A. Beatriz Garmendia-Doval, John ...
CORR
2010
Springer
186views Education» more  CORR 2010»
13 years 8 months ago
Channel Estimation for Opportunistic Spectrum Access: Uniform and Random Sensing
The knowledge of channel statistics can be very helpful in making sound opportunistic spectrum access decisions. It is therefore desirable to be able to efficiently and accurately...
Quanquan Liang, Mingyan Liu