JunctionTrees.jl implements the junction tree algorithm: an efficient method to perform Bayesian inference in discrete probabilistic graphical models. It exploits Julia's metaprogramming capabilities to separate the algorithm into a compilation and a runtime phase. This opens a wide range of optimization possibilities in the compilation stage. The non-optimized runtime performance of JunctionTrees.jl is similar to those of analog C++ libraries such as libdai and Merlin.

For more info on the Julia Programming Language, follow us on Twitter: [ Ссылка ] and consider sponsoring us on GitHub: [ Ссылка ]

00:00 Welcome!
00:10 Help us add time stamps or captions to this video! See the description for details.

Want to help add timestamps to our YouTube videos to help with discoverability? Find out more here: [ Ссылка ]

Interested in improving the auto generated captions? Get involved here: [ Ссылка ]

свернуть