
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Ivona Bez?kov?, "Sampling Binary Contingency Tables," Computing in Science and Engineering, vol. 10, no. 2, pp. 2631, March/April, 2008.  
BibTex  x  
@article{ 10.1109/MCSE.2008.62, author = {Ivona Bez?kov?}, title = {Sampling Binary Contingency Tables}, journal ={Computing in Science and Engineering}, volume = {10}, number = {2}, issn = {15219615}, year = {2008}, pages = {2631}, doi = {http://doi.ieeecomputersociety.org/10.1109/MCSE.2008.62}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  MGZN JO  Computing in Science and Engineering TI  Sampling Binary Contingency Tables IS  2 SN  15219615 SP26 EP31 EPD  2631 A1  Ivona Bez?kov?, PY  2008 KW  computing KW  combinatorics KW  combinatorial KW  binary tables KW  statistics KW  combinatorics in computing VL  10 JA  Computing in Science and Engineering ER   
1. Y. Chen et al., "Sequential Monte Carlo Methods for Statistical Analysis of Tables," J. Am. Statistical Assoc., vol. 100, no. 469, 2005, pp. 109–120.
2. F.D. Steinheimer, "Charles Darwin's Bird Collection and Ornithological Knowledge during the Voyage of H.M.S. Beagle, 1831–1836," J. Ornithology, vol. 145, no. 4, 2004, pp. 300–320.
3. A. Roberts and L. Stone, "IslandSharing by Archipelago Species," Oecologia, vol. 83, no. 4, 1990, pp. 560–567.
4. I. Beichl and F. Sullivan, "The Other Monte Carlo Method," Computing in Science &Eng., vol. 8, no. 2, 2006, pp. 42–47.
5. J. Blanchet, "Efficient Importance Sampling for Binary Contingency Tables," to be published in the Annals of Applied Probability, 2008.
6. I. Bezáková et al., "Negative Examples for Sequential Importance Sampling of Binary Contingency Tables," preprint available at http://front.math.ucdavis.edu/math.ST0606650 .
7. D. Randall, "Rapidly Mixing Markov Chains with Applications in Computer Science and Physics," Computing in Science &Eng., vol. 8, no. 2, 2006, pp. 30–41.
8. P. Diaconis and A. Gangolli, "Rectangular Arrays with Fixed Margins," Discrete Probability and Algorithms, D. Aldous et al., eds., SpringerVerlag, 1995, pp. 15–41.
9. R. Kannan, P. Tetali, and S. Vempala, "Simple MarkovChain Algorithms for Generating Bipartite Graphs and Tournaments," Random Structures and Algorithms, vol. 14, no. 4, 1999, pp. 293–308.
10. M. Jerrum, A. Sinclair, and E. Vigoda, "A PolynomialTime Approximation Algorithm for the Permanent of a Matrix with NonNegative Entries," J. ACM, vol. 51, no. 4, 2004, pp. 671–697.
11. I. Bezáková, N. Bhatnagar, and E. Vigoda, "Sampling Binary Contingency Tables with a Greedy Start," Random Structures and Algorithms, vol. 30, nos. 1–2, 2007, pp. 168–205.