Reference Citation Analysis: Find an Article, Find a Category, Find a Journal, Find a Scholar

For:	Ramos FT, Cozman FG. Anytime anyspace probabilistic inference. Int J Approx Reason 2005. [DOI: 10.1016/j.ijar.2004.04.001] [Citation(s) in RCA: 9] [Impact Index Per Article: 0.5] [Reference Citation Analysis] [What about the content of this article? (0)] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 10/26/2022]

Number	Cited by Other Article(s)
1	Ramos-López D, Masegosa AR, Salmerón A, Rumí R, Langseth H, Nielsen TD, Madsen AL. Scalable importance sampling estimation of Gaussian mixture posteriors in Bayesian networks. Int J Approx Reason 2018. [DOI: 10.1016/j.ijar.2018.06.004] [Citation(s) in RCA: 2] [Impact Index Per Article: 0.3] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 10/28/2022] Abstract Collapse Key Words Collapse MESH Headings Collapse Grants Collapse Affiliation(s) Collapse
2	An extended depth-first search algorithm for optimal triangulation of Bayesian networks. Int J Approx Reason 2017. [DOI: 10.1016/j.ijar.2016.09.012] [Citation(s) in RCA: 7] [Impact Index Per Article: 1.0] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/23/2022] Abstract Collapse Key Words Collapse MESH Headings Collapse Grants Collapse Affiliation(s) Collapse
3	All roads lead to Rome—New search methods for the optimal triangulation problem. Int J Approx Reason 2012. [DOI: 10.1016/j.ijar.2012.06.006] [Citation(s) in RCA: 5] [Impact Index Per Article: 0.4] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/22/2022] Abstract Collapse Key Words Collapse MESH Headings Collapse Grants Collapse Affiliation(s) Collapse
4	Grant K. Efficient indexing methods for recursive decompositions of Bayesian networks. Int J Approx Reason 2012. [DOI: 10.1016/j.ijar.2012.03.001] [Citation(s) in RCA: 1] [Impact Index Per Article: 0.1] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 10/28/2022] Abstract Collapse Key Words Collapse MESH Headings Collapse Grants Collapse Affiliation(s) Collapse
5	Grant K, Horsch MC. Methods for constructing balanced elimination trees and other recursive decompositions. Int J Approx Reason 2009. [DOI: 10.1016/j.ijar.2009.04.010] [Citation(s) in RCA: 2] [Impact Index Per Article: 0.1] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 10/20/2022] Abstract Collapse Key Words Collapse MESH Headings Collapse Grants Collapse Affiliation(s) Collapse
6	Ide JS, Cozman FG. Approximate algorithms for credal networks with binary variables. Int J Approx Reason 2008. [DOI: 10.1016/j.ijar.2007.09.003] [Citation(s) in RCA: 8] [Impact Index Per Article: 0.5] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 10/22/2022] Abstract Collapse Key Words Collapse MESH Headings Collapse Grants Collapse Affiliation(s) Collapse