{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:57:52Z","timestamp":1742914672030,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642210426"},{"type":"electronic","value":"9783642210433"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-21043-3_47","type":"book-chapter","created":{"date-parts":[[2011,5,24]],"date-time":"2011-05-24T16:36:15Z","timestamp":1306254975000},"page":"390-395","source":"Crossref","is-referenced-by-count":1,"title":["Parallelizing a Convergent Approximate Inference Method"],"prefix":"10.1007","author":[{"given":"Ming","family":"Su","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elizabeth","family":"Thompson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"47_CR1","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1017\/S0001867800029475","volume":"10","author":"C. Cannings","year":"1978","unstructured":"Cannings, C., Thompson, E.A., Skolnick, M.H.: Probability functions on complex pedigrees. Advances in Applied Probability\u00a010, 26\u201361 (1978)","journal-title":"Advances in Applied Probability"},{"key":"47_CR2","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1038\/ng786","volume":"30","author":"G.R. Abecasis","year":"2002","unstructured":"Abecasis, G.R., Cherny, S.S., Cookson, W.O., Cardon, L.R.: Merlin \u2013 rapid analysis of dense genetic maps using sparse gene flow trees. Nature Genetics\u00a030, 97\u2013101 (2002)","journal-title":"Nature Genetics"},{"key":"47_CR3","doi-asserted-by":"crossref","unstructured":"Shachter, R.D., Andersen, S.K.: Global Conditioning for Probabilistic Inference in Belief Networks. In: UAI (1994)","DOI":"10.1016\/B978-1-55860-332-5.50070-5"},{"key":"47_CR4","unstructured":"Pennock, D.: Logarithmic Time Parallel Bayesian Inference. In: UAI, pp. 431\u2013443 (1998)"},{"key":"47_CR5","doi-asserted-by":"crossref","unstructured":"Kozlov, A., Singh, J.: A Parallel Lauritzen-Spiegelhalter Algorithm for Probabilistic Inference. In: Proceedings of the 1994 Conference on Supercomputing, pp. 320\u2013329 (1994)","DOI":"10.1145\/602827.602830"},{"key":"47_CR6","doi-asserted-by":"crossref","unstructured":"Namasivayam, V.K., Pathak, A., Prasanna, V.K.: Scalable Parallel Implementation of Bayesian Network to Junction Tree Conversion for Exact Inference. In: 18th International Symposium on Computer Architecture and High Performance Computing (SBAC-PAD 2006), pp. 167\u2013176 (2006)","DOI":"10.1109\/SBAC-PAD.2006.26"},{"key":"47_CR7","doi-asserted-by":"crossref","unstructured":"Xia, Y., Prasanna, V.K.: Parallel exact inference on the cell broadband engine processor. In: Proceedings of the 2008 ACM\/IEEE Conference on Supercomputing, pp. 1\u201312 (2008)","DOI":"10.1109\/SC.2008.5219769"},{"key":"47_CR8","doi-asserted-by":"crossref","unstructured":"Botetz, B.: Efficient belief propagation for vision using linear constraint nodes. In: Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition (2007)","DOI":"10.1109\/CVPR.2007.383094"},{"key":"47_CR9","first-page":"689","volume-title":"NIPS","author":"J.S. Yedidia","year":"2000","unstructured":"Yedidia, J.S., Freeman, W.T., Weiss, Y.: Generalized belief propagation. In: NIPS, pp. 689\u2013695. MIT Press, Cambridge (2000)"},{"key":"47_CR10","unstructured":"Gonzalez, J., Low, Y., Guestrin, C., O\u2019Hallaron, D.: Distributed Parallel Inference on Large Factor Graphs. In: UAI (2009b)"},{"key":"47_CR11","unstructured":"Teh, Y.W., Welling, M.: The unified propagation and scaling algorithm. In: NIPS, pp. 953\u2013960 (2001)"},{"key":"47_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1007\/978-3-540-24670-1_27","volume-title":"Computer Vision - ECCV 2004","author":"P. Carbonetto","year":"2004","unstructured":"Carbonetto, P., de Freitas, N., Barnard, K.: A statistical model for general contextual object recognition. In: Pajdla, T., Matas, J(G.) (eds.) ECCV 2004. LNCS, vol.\u00a03021, pp. 350\u2013362. Springer, Heidelberg (2004)"},{"issue":"14","key":"47_CR13","doi-asserted-by":"publisher","first-page":"1264","DOI":"10.1016\/j.patrec.2009.06.010","volume":"30","author":"Z. Xie","year":"2009","unstructured":"Xie, Z., Gao, J., Wu, X.: Regional category parsing in undirected graphical models. Pattern Recognition Letters\u00a030(14), 1264\u20131272 (2009)","journal-title":"Pattern Recognition Letters"},{"key":"47_CR14","unstructured":"Su, M.: On the Convergence of Convex Relaxation Method and Distributed Optimization of Bethe Free Energy. In: Proceedings of the 11th International Symposium on Artificial Intelligence and Mathematics (ISAIM), Fort Lauderdale, Florida (2010)"},{"key":"47_CR15","unstructured":"Heskes, T.: Stable fixed points of loopy belief propagation are local minima of the Bethe free energy. In: NIPS, pp. 343\u2013350 (2002)"},{"key":"47_CR16","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0166-218X(94)90134-1","volume":"54","author":"I. Tomescu","year":"1994","unstructured":"Tomescu, I., Zimand, M.: Minimum spanning hypertrees. Discrete Applied Mathematics\u00a054, 67\u201376 (1994)","journal-title":"Discrete Applied Mathematics"},{"key":"47_CR17","unstructured":"Dean, J., Ghemawat, S.: MapReduce: Simplified Data Processing on Large Clusters. In: Proceedings of the Sixth Symposium on Operating System Design and Implementation, San Francisco, CA (2004)"},{"key":"47_CR18","unstructured":"Karypis, G., Kumar, V.: hMETIS: A Hypergraph Partitioning Package (1998), http:\/\/glaros.dtc.umn.edu\/gkhome\/fetch\/sw\/hmetis\/manual.pdf"}],"container-title":["Lecture Notes in Computer Science","Advances in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21043-3_47","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,5]],"date-time":"2025-03-05T19:48:44Z","timestamp":1741204124000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21043-3_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642210426","9783642210433"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21043-3_47","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}