Please log in to take part in the discussion (add own reviews or comments).
Cite this publication
More citation styles
- please select -
%0 Conference Paper
%1 conf/uai/BeckerG96
%A Becker, Ann
%A Geiger, Dan
%B UAI
%D 1996
%E Horvitz, Eric
%E Jensen, Finn Verner
%I Morgan Kaufmann
%K dblp
%P 81-89
%T A sufficiently fast algorithm for finding close to optimal junction trees.
%U http://dblp.uni-trier.de/db/conf/uai/uai1996.html#BeckerG96
%@ 1-55860-412-X
@inproceedings{conf/uai/BeckerG96,
added-at = {2021-02-03T00:00:00.000+0100},
author = {Becker, Ann and Geiger, Dan},
biburl = {https://www.bibsonomy.org/bibtex/2b6b9cbf960c21d4997a0f119fe5a9a33/dblp},
booktitle = {UAI},
crossref = {conf/uai/1996},
editor = {Horvitz, Eric and Jensen, Finn Verner},
ee = {https://dslpitt.org/uai/displayArticleDetails.jsp?mmnu=1&smnu=2&article_id=355&proceeding_id=12},
interhash = {871370cffd630228dbf130e0d7f248f6},
intrahash = {b6b9cbf960c21d4997a0f119fe5a9a33},
isbn = {1-55860-412-X},
keywords = {dblp},
pages = {81-89},
publisher = {Morgan Kaufmann},
timestamp = {2024-04-10T12:05:24.000+0200},
title = {A sufficiently fast algorithm for finding close to optimal junction trees.},
url = {http://dblp.uni-trier.de/db/conf/uai/uai1996.html#BeckerG96},
year = 1996
}
