Sciweavers

Share
29 search results - page 1 / 6
» New Constraints on Generation of Uniform Random Samples from...
Sort
View
CCECE
2006
IEEE
9 years 11 months ago
New Constraints on Generation of Uniform Random Samples from Evolutionary Trees
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...
Anupam Bhattacharjee, Zalia Shams, Kazi Zakia Sult...
CP
2006
Springer
9 years 9 months ago
A New Algorithm for Sampling CSP Solutions Uniformly at Random
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...
Vibhav Gogate, Rina Dechter
CORR
2010
Springer
162views Education» more  CORR 2010»
9 years 5 months ago
Random sampling of lattice paths with constraints, via transportation
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...
Lucas Gerin
CALDAM
2016
53views more  CALDAM 2016»
4 years 1 months ago
Random-Bit Optimal Uniform Sampling for Rooted Planar Trees with Given Sequence of Degrees and Applications
In this paper, we redesign and simplify an algorithm due to Remy et al. for the generation of rooted planar trees that satisīŦes a given partition of degrees. This new version is ...
Olivier Bodini, David Julien, Philippe Marchal
FOCS
2009
IEEE
10 years 10 days ago
Faster Generation of Random Spanning Trees
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...
Jonathan A. Kelner, Aleksander Madry
books