139 search results - page 1 / 28 » Fast perfect sampling from linear extensions |
DM
2006
13 years 4 months ago
2006
In this paper, we study the problem of sampling (exactly) uniformly from the set of linear extensions of an arbitrary partial order. Previous Markov chain techniques have yielded ...
ICASSP
2008
IEEE
13 years 11 months ago
2008
IEEE
We describe an algorithm for perfect weighted-random sampling of a population with time complexity O(m + n) for sampling m inputs to produce n outputs. This algorithm is an increm...
FOCS
2000
IEEE
13 years 9 months ago
2000
IEEE
For many probability distributions of interest, it is quite difficult to obtain samples efficiently. Often, Markov chains are employed to obtain approximately random samples fro...
SODA
2008
ACM
13 years 6 months ago
2008
ACM
We show how to find a normal form proper equilibrium in behavior strategies of a given two-player zero-sum extensive form game with imperfect information but perfect recall. Our a...
UAI
2003
13 years 6 months ago
2003
We prove that perfect distributions exist when using a finite number of bits to represent the parameters of a Bayesian network. In addition, we provide an upper bound on the prob...