17 search results - page 1 / 4 » Sampling Binary Contingency Tables |
CORR
2010
Springer
13 years 4 months ago
2010
Springer
A binary contingency table is an
CSE
2008
IEEE
13 years 4 months ago
2008
IEEE
We study the problem of counting and randomly sampling binary contingency tables. For given row and column sums, we are interested in approximately counting (or sampling) 0/1 n
ESA
2006
Springer
13 years 8 months ago
2006
Springer
The sequential importance sampling (SIS) algorithm has gained considerable popularity for its empirical success. One of its noted applications is to the binary contingency tables p...
COCOON
2009
Springer
13 years 11 months ago
2009
Springer
The problems of uniformly sampling and approximately counting contingency tables have been widely studied, but efficient solutions are only known in special cases. One appealing ap...
FOCS
2002
IEEE
13 years 9 months ago
2002
IEEE
We consider the problem of sampling almost uniformly from the set of contingency tables with given row and column sums, when the number of rows is a constant. Cryan and Dyer [3] h...