Reduction of Computational Complexity in Bayesian Networks through Removal of Weak Dependences

Research output: Contribution to book/anthology/report/conference proceedingArticle in proceedingResearch

Original languageEnglish
Title of host publicationProceedings of the Tenth Conference on Uncertainty in Artificial Intelligence
PublisherMorgan Kaufmann
Publication date1994
Pages374-382
Publication statusPublished - 1994
EventConference on Uncertainty in Artificial Intelligence - Banff, Canada
Duration: 8 Jul 200411 Jul 2004
Conference number: 10

Conference

ConferenceConference on Uncertainty in Artificial Intelligence
Number10
CountryCanada
CityBanff
Period08/07/200411/07/2004

Cite this

Kjærulff, U. B. (1994). Reduction of Computational Complexity in Bayesian Networks through Removal of Weak Dependences. In Proceedings of the Tenth Conference on Uncertainty in Artificial Intelligence (pp. 374-382). Morgan Kaufmann.