1618 search results - page 37 / 324 » Testing random number generators |
CAEPIA
2003
Springer
14 years 3 months ago
2003
Springer
Abstract. We propose two different methods for generating random orthogonal polygons with a given number of vertices. One is a polynomial time algorithm and it is supported by a t...
ISAAC
2009
Springer
14 years 4 months ago
2009
Springer
Connected bipartite permutation graphs without vertex labels are investigated. First, the number of connected bipartite permutation graphs of n vertices is given. Based on the num...
CRYPTO
1998
Springer
14 years 2 months ago
1998
Springer
The exponentiation function in a finite field of order p (a prime number) is believed to be a one-way function. It is well known that O(log log p) bits are simultaneously hard for ...
JCT
2010
13 years 8 months ago
2010
Abstract. New enumerating functions for the Euler numbers are considered. Several of the relevant generating functions appear in connection to entries in Ramanujan’s Lost Noteboo...
BMCBI
2006
13 years 10 months ago
2006
Background: The number of k-words shared between two sequences is a simple and effcient alignment-free sequence comparison method. This statistic, D2, has been used for the cluste...