Title :
Sampling Binary Contingency Tables
Author_Institution :
Rochester Inst. of Technol., Rochester
Abstract :
The binary contingency tables problem has sparked the interest of statisticians and computer scientists alike. Although it´s been studied from both theoretical and practical perspectives, a truly usable algorithm remains elusive. The author presents several approaches to the problem.
Keywords :
Markov processes; algorithm theory; importance sampling; algorithm; binary contingency table sampling; importance sampling; Birds; Distributed computing; Geologic measurements; Geology; Monte Carlo methods; Sampling methods; Sparks; Statistical analysis; Statistics; Testing; binary tables; combinatorial; combinatorics; combinatorics in computing; computing; statistics;
Journal_Title :
Computing in Science & Engineering
DOI :
10.1109/MCSE.2008.62