{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T08:15:54Z","timestamp":1760170554422,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,2,21]],"date-time":"2010-02-21T00:00:00Z","timestamp":1266710400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2010,2,21]]},"DOI":"10.1145\/1723112.1723127","type":"proceedings-article","created":{"date-parts":[[2010,2,23]],"date-time":"2010-02-23T15:35:30Z","timestamp":1266939330000},"page":"73-82","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":33,"title":["High-throughput bayesian computing machine with reconfigurable hardware"],"prefix":"10.1145","author":[{"given":"Mingjie","family":"Lin","sequence":"first","affiliation":[{"name":"UC Berkeley, Berkeley, CA, USA"}],"role":[{"role":"author","vocab":"crossref"}]},{"given":"Ilia","family":"Lebedev","sequence":"additional","affiliation":[{"name":"UC Berkeley, Berkeley, CA, USA"}],"role":[{"role":"author","vocab":"crossref"}]},{"given":"John","family":"Wawrzynek","sequence":"additional","affiliation":[{"name":"UC Berkeley, Berkeley, CA, USA"}],"role":[{"role":"author","vocab":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2010,2,21]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Pattern Recognition and Machine Learning (Information Science and Statistics)","author":"Bishop C.","year":"2006","unstructured":"C. Bishop , Pattern Recognition and Machine Learning (Information Science and Statistics) . Springer , August 2006 . C. Bishop, Pattern Recognition and Machine Learning (Information Science and Statistics). Springer, August 2006."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-006-7899-4"},{"key":"e_1_3_2_1_3_1","volume-title":"Probabilistic reasoning in intelligent systems: networks of plausible inference","author":"Pearl J.","year":"1988","unstructured":"J. Pearl , Probabilistic reasoning in intelligent systems: networks of plausible inference . San Francisco, CA, USA : Morgan Kaufmann Publishers Inc ., 1988 . J. Pearl, Probabilistic reasoning in intelligent systems: networks of plausible inference. San Francisco, CA, USA: Morgan Kaufmann Publishers Inc., 1988."},{"key":"e_1_3_2_1_4_1","first-page":"2006","volume-title":"Speech and Signal Processing, 2006. ICASSP 2006 Proceedings. 2006 IEEE International Conference on","volume":"2","author":"Eltoukhy H.","unstructured":"H. Eltoukhy and A. El Gamal , \" Modeling and base-calling for DNA sequencing-by-synthesis,\" in Acoustics , Speech and Signal Processing, 2006. ICASSP 2006 Proceedings. 2006 IEEE International Conference on , vol. 2 , pp. II-II, May 2006 . H. Eltoukhy and A. El Gamal, \"Modeling and base-calling for DNA sequencing-by-synthesis,\" in Acoustics, Speech and Signal Processing, 2006. ICASSP 2006 Proceedings. 2006 IEEE International Conference on, vol. 2, pp. II-II, May 2006."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pcbi.0030252"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1089\/106652700750050961"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01734359"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.1094068"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0403564101"},{"key":"e_1_3_2_1_10_1","first-page":"206","volume-title":"Learning Bayesian network structure from massive datasets: The 'sparse candidate' algorithm","author":"Friedman N.","year":"1999","unstructured":"N. Friedman , I. Nachman , and D. Peer , \" Learning Bayesian network structure from massive datasets: The 'sparse candidate' algorithm ,\" pp. 206 -- 215 , 1999 . N. Friedman, I. Nachman, and D. Peer, \"Learning Bayesian network structure from massive datasets: The 'sparse candidate' algorithm,\" pp. 206--215, 1999."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0269888900003039"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1344671.1344702"},{"key":"e_1_3_2_1_13_1","first-page":"711","volume-title":"MIXDES 2006. Proceedings of the International Conference","author":"Kulesza Z.","year":"2006","unstructured":"Z. Kulesza and W. Tylman , \" Implementation of Bayesian network in FPGA circuit,\" in Mixed Design of Integrated Circuits and System, 2006 . MIXDES 2006. Proceedings of the International Conference , pp. 711 -- 715 , June 2006 . Z. Kulesza and W. Tylman, \"Implementation of Bayesian network in FPGA circuit,\" in Mixed Design of Integrated Circuits and System, 2006. MIXDES 2006. Proceedings of the International Conference, pp. 711--715, June 2006."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/FPL.2005.1515742"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1098\/rstb.2007.2129"},{"key":"e_1_3_2_1_16_1","volume-title":"Computers and Intractability","author":"Garey M. R.","year":"1990","unstructured":"M. R. Garey and D. S. Johnson , Computers and Intractability ; A Guide to the Theory of NP-Completeness . New York, NY, USA : W. H. Freeman & Co. , 1990 . M. R. Garey and D. S. Johnson, Computers and Intractability; A Guide to the Theory of NP-Completeness. New York, NY, USA: W. H. Freeman & Co., 1990."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"crossref","unstructured":"C. McCreary A. A. Khan J. Thompson and M. McArdle \"A comparison of heuristics for scheduling DAGs on multiprocessors \" in in Proceedings of the Eighth International Parallel Processing Symposium pp. 446--451 1994. C. McCreary A. A. Khan J. Thompson and M. McArdle \"A comparison of heuristics for scheduling DAGs on multiprocessors \" in in Proceedings of the Eighth International Parallel Processing Symposium pp. 446--451 1994.","DOI":"10.1109\/IPPS.1994.288264"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"crossref","unstructured":"A. Munier M. Queyranne and A. Schulz \" Approximation bounds for a general class of precedence constrained parallel machine scheduling problems \" in Integer Programming and Combinatorial Optimization volume 1412 of Lecture Notes in Computer Science pp. 367 -- 382 Springer 1998 . A. Munier M. Queyranne and A. Schulz \"Approximation bounds for a general class of precedence constrained parallel machine scheduling problems \" in Integer Programming and Combinatorial Optimization volume 1412 of Lecture Notes in Computer Science pp. 367--382 Springer 1998.","DOI":"10.1007\/3-540-69346-7_28"},{"key":"e_1_3_2_1_19_1","first-page":"182","volume-title":"DC, USA)","author":"Lienhart G.","year":"2002","unstructured":"G. Lienhart , A. Kugel , and R. M\u00e4nner , \" Using floating-point arithmetic on FPGAs to accelerate scientific N-Body simulations,\" in FCCM '02: Proceedings of the 10th Annual IEEE Symposium on Field-Programmable Custom Computing Machines, (Washington , DC, USA) , p. 182 , IEEE Computer Society , 2002 . G. Lienhart, A. Kugel, and R. M\u00e4nner, \"Using floating-point arithmetic on FPGAs to accelerate scientific N-Body simulations,\" in FCCM '02: Proceedings of the 10th Annual IEEE Symposium on Field-Programmable Custom Computing Machines, (Washington, DC, USA), p. 182, IEEE Computer Society, 2002."},{"key":"e_1_3_2_1_20_1","first-page":"627","volume-title":"12th International Conference on Field-Programmable Logic and Applications","author":"Matousek R.","year":"2002","unstructured":"R. Matousek , M. Tich\u00fd , Z. Pohl , J. Kadlec , C. Softley , and N. Coleman , \" Logarithmic number system and floating-point arithmetics on FPGA,\" in FPL '02: Proceedings of the Reconfigurable Computing Is Going Mainstream , 12th International Conference on Field-Programmable Logic and Applications , ( London, UK) , pp. 627 -- 636 , Springer-Verlag, 2002 . R. Matousek, M. Tich\u00fd, Z. Pohl, J. Kadlec, C. Softley, and N. Coleman, \"Logarithmic number system and floating-point arithmetics on FPGA,\" in FPL '02: Proceedings of the Reconfigurable Computing Is Going Mainstream, 12th International Conference on Field-Programmable Logic and Applications, (London, UK), pp. 627--636, Springer-Verlag, 2002."},{"key":"e_1_3_2_1_21_1","first-page":"1186","volume-title":"Systems and Computers, 2005. Conference Record of the Thirty-Ninth Asilomar Conference on","author":"Detrey J.","year":"2005","unstructured":"J. Detrey and F. de Dinechin , \"A parameterizable floating-point logarithm operator for FPGAs,\" in Signals , Systems and Computers, 2005. Conference Record of the Thirty-Ninth Asilomar Conference on , pp. 1186 -- 1190 , 28 - November 1, 2005 . J. Detrey and F. de Dinechin, \"A parameterizable floating-point logarithm operator for FPGAs,\" in Signals, Systems and Computers, 2005. Conference Record of the Thirty-Ninth Asilomar Conference on, pp. 1186--1190, 28 - November 1, 2005."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8659.2007.01012.x"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1375527.1375572"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/18.suppl_1.S189"}],"event":{"name":"FPGA '10: ACM\/SIGDA International Symposium on Field Programmable Gate Arrays","sponsor":["SIGDA ACM Special Interest Group on Design Automation"],"location":"Monterey California USA","acronym":"FPGA '10"},"container-title":["Proceedings of the 18th annual ACM\/SIGDA international symposium on Field programmable gate arrays"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1723112.1723127","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1723112.1723127","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:41:15Z","timestamp":1750250475000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1723112.1723127"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,2,21]]},"references-count":24,"alternative-id":["10.1145\/1723112.1723127","10.1145\/1723112"],"URL":"https:\/\/doi.org\/10.1145\/1723112.1723127","relation":{},"subject":[],"published":{"date-parts":[[2010,2,21]]},"assertion":[{"value":"2010-02-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}