Sciweavers

73 search results - page 11 / 15
» FPGA-optimised high-quality uniform random number generators
Sort
View
DLT
2003
13 years 8 months ago
Frequency of Symbol Occurrences in Simple Non-primitive Stochastic Models
We study the random variable Yn representing the number of occurrences of a given symbol in a word of length n generated at random. The stochastic model we assume is a simple non-e...
Diego de Falco, Massimiliano Goldwurm, Violetta Lo...
ISAAC
2005
Springer
123views Algorithms» more  ISAAC 2005»
14 years 6 days ago
Sampling Unlabeled Biconnected Planar Graphs
We present an expected polynomial time algorithm to generate a 2-connected unlabeled planar graph uniformly at random. To do this we first derive recurrence formulas to count the ...
Manuel Bodirsky, Clemens Gröpl, Mihyun Kang
DATE
2009
IEEE
90views Hardware» more  DATE 2009»
14 years 1 months ago
Property analysis and design understanding
—Verification is a major issue in circuit and system design. Formal methods like bounded model checking (BMC) can guarantee a high quality of the verification. There are severa...
Ulrich Kühne, Daniel Große, Rolf Drechs...
DMIN
2006
134views Data Mining» more  DMIN 2006»
13 years 8 months ago
Hyper-Rectangular and k-Nearest-Neighbor Models in Stochastic Discrimination
The stochastic discrimination (SD) theory considers learning as building models of uniform coverage over data distributions. Despite successful trials of the derived SD method in s...
Iryna Skrypnyk, Tin Kam Ho
CCR
2005
129views more  CCR 2005»
13 years 6 months ago
The problem of synthetically generating IP traffic matrices: initial recommendations
There exist a wide variety of network design problems that require a traffic matrix as input in order to carry out performance evaluation. The research community has not had at it...
Antonio Nucci, Ashwin Sridharan, Nina Taft