Sciweavers

1457 search results - page 57 / 292
» On the Uniform Distribution of Strings
Sort
View
WSC
2008
15 years 8 months ago
Comparing two systems: Beyond common random numbers
Suppose one wishes to compare two closely related systems via stochastic simulation. Common random numbers (CRN) involves using the same streams of uniform random variates as inpu...
Samuel Ehrlichman, Shane G. Henderson
SODA
2003
ACM
115views Algorithms» more  SODA 2003»
15 years 7 months ago
Random walks on the vertices of transportation polytopes with constant number of sources
We consider the problem of uniformly sampling a vertex of a transportation polytope with m sources and n destinations, where m is a constant. We analyse a natural random walk on t...
Mary Cryan, Martin E. Dyer, Haiko Müller, Lee...
MOC
2002
75views more  MOC 2002»
15 years 5 months ago
Average equidistribution and statistical independence properties of digital inversive pseudorandom numbers over parts of the per
This article deals with the digital inversive method for generating uniform pseudorandom numbers. Equidistribution and statistical independence properties of the generated pseudora...
Frank Emmerich
SP
2002
IEEE
122views Security Privacy» more  SP 2002»
15 years 5 months ago
The UNICORE Grid infrastructure
UNICORE (Uniform Interface to Computer Resources) is a software infrastructure supporting seamless and secure access to distributed resources. UNICORE allows uniform access to dif...
Mathilde Romberg
IPPS
2003
IEEE
15 years 11 months ago
A BSP/CGM Algorithm for the All-Substrings Longest Common Subsequence Problem
Given two strings and of lengths Ñ and Ò, respectively, the all-substrings longest common subsequence (ALCS) problem obtains the lengths of the subsequences common to and any su...
Carlos E. R. Alves, Edson Cáceres, Siang W....