Sciweavers

6111 search results - page 16 / 1223
» Time, Hardware, and Uniformity
Sort
View
FCCM
2006
IEEE
138views VLSI» more  FCCM 2006»
13 years 11 months ago
Efficient Hardware Generation of Random Variates with Arbitrary Distributions
This paper presents a technique for efficiently generating random numbers from a given probability distribution. This is achieved by using a generic hardware architecture, which t...
David B. Thomas, Wayne Luk
JFP
2000
91views more  JFP 2000»
13 years 7 months ago
Uniform confluence in concurrent computation
Indeterminism is typical for concurrent computation. If several concurrent actors compete for the same resource then at most one of them may succeed, whereby the choice of the suc...
Joachim Niehren
CORR
2008
Springer
110views Education» more  CORR 2008»
13 years 7 months ago
Perfect Matchings via Uniform Sampling in Regular Bipartite Graphs
In this paper we further investigate the well-studied problem of finding a perfect matching in a regular bipartite graph. The first non-trivial algorithm, with running time O(mn),...
Ashish Goel, Michael Kapralov, Sanjeev Khanna
CCGRID
2003
IEEE
14 years 27 days ago
Leveraging Non-Uniform Resources for Parallel Query Processing
Clusters are now composed of non-uniform nodes with different CPUs, disks or network cards so that customers can adapt the cluster configuration to the changing technologies and t...
Tobias Mayr, Philippe Bonnet, Johannes Gehrke, Pra...
STRINGOLOGY
2008
13 years 9 months ago
On the Uniform Distribution of Strings
In this paper, we propose the definition of a measure for sets of strings of length not greater than a given number. This measure leads to an instanciation of the uniform distribut...
Sébastien Rebecchi, Jean-Michel Jolion