Sciweavers

CSE
2008
IEEE
13 years 11 months ago
Sampling Binary Contingency Tables
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
Ivona Bezáková
ESA
2006
Springer
77views Algorithms» more  ESA 2006»
14 years 3 months ago
Negative Examples for Sequential Importance Sampling of Binary Contingency Tables
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...
Ivona Bezáková, Alistair Sinclair, D...