Marek J. Druzdzel

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Yan Lin

> Home > Persons > Marek J. Druzdzel

Publications

2013
[i12]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1302-1558
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1302-1558
Yan Lin, Marek J. Druzdzel:
Computational Advantages of Relevance Reasoning in Bayesian Belief Networks. CoRR abs/1302.1558 (2013)
1999
[j2]
- view
  authority control:
- export record
  dblp key:
  - journals/ijprai/LinD99
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ijprai/LinD99
Yan Lin, Marek J. Druzdzel:
Relevance-Based Incremental Belief Updating in Bayesian Networks. Int. J. Pattern Recognit. Artif. Intell. 13(2): 285-295 (1999)
1998
[c8]
- view
  - electronic edition @ aaai.org (open access)
  - no references & citations available
- export record
  dblp key:
  - conf/flairs/LinD98
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/flairs/LinD98
Yan Lin, Marek J. Druzdzel:
Relevance-Based Sequential Evidence Processing in Bayesian Networks. FLAIRS 1998: 446-450
1997
[c7]
- view
  - electronic edition @ dslpitt.org (archived)
  - no references & citations available
- export record
  dblp key:
  - conf/uai/LinD97
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/uai/LinD97
Yan Lin, Marek J. Druzdzel:
Computational Advantages of Relevance Reasoning in Bayesian Belief Networks. UAI 1997: 342-350

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.