27 search results - page 1 / 6 » New Constraints on Generation of Uniform Random Samples from... |
CCECE
2006
IEEE
13 years 10 months ago
2006
IEEE
In this paper, we introduce new algorithms for selecting taxon samples from large evolutionary trees, maintaining uniformity and randomness, under certain new constraints on the t...
CP
2006
Springer
13 years 8 months ago
2006
Springer
The paper presents a method for generating solutions of a constraint satisfaction problem (CSP) uniformly at random. The main idea is to express the CSP as a factored probability d...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
We investigate Monte Carlo Markov Chain (MCMC) procedures for the random sampling of some one-dimensional lattice paths with constraints, for various constraints. We will see that...
FOCS
2009
IEEE
13 years 11 months ago
2009
IEEE
In this paper, we set forth a new algorithm for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is wi...
FPL
2006
Springer
13 years 8 months ago
2006
Springer
This paper presents a hardware architecture for non-uniform random number generation, which allows the generator's distribution to be modified at run-time without reconfigura...