Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

CSE
2008
IEEE

favoriteEmaildiscussreport

69views Theoretical Computer Science» more CSE 2008»

Sampling Binary Contingency Tables

13 years 4 months ago

Sampling Binary Contingency Tables

Download people.cs.uchicago.edu

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á

Real-time Traffic

Algorithm | Binary Contingency Tables | CSE 2008 | Sums | Theoretical Computer Science |

claim paper

Related Content

» Characterizing Optimal Sampling of Binary Contingency Tables via the Configuration Model

» Negative Examples for Sequential Importance Sampling of Binary Contingency Tables

» On the DiaconisGangolli Markov Chain for Sampling Contingency Tables with CellBounded Entr...

» Rapidly Mixing Markov Chains for Sampling Contingency Tables with a Constant Number of Row...

» Implicative Analysis for Multivariate Binary Data using an Imprecise Dirichlet Model

» Sampling Strategies to Evaluate the Performance of Unknown Predictors

» Random walks on the vertices of transportation polytopes with constant number of sources

» Maximum Margin Learning with Incomplete Data Learning Networks instead of Tables

» Approximate counting by dynamic programming

Post Info
More Details (n/a)

Added	10 Dec 2010
Updated	10 Dec 2010
Type	Journal
Year	2008
Where	CSE
Authors	Ivona Bezáková

Comments (0)