2 citations · 3 across the 4 of their papers we have counts for
4 papers
Compositional Algorithms on Compositional Data: Deciding Sheaves on Presheaves
Ernst Althaus, Benjamin Merlin Bumpus, James Fairbanks +1
Algorithmicists are well-aware that fast dynamic programming algorithms are very often the correct choice when computing on compositional (or even recursive) graphs. Here we initia…
Fast Private Parameter Learning and Inference for Sum-Product Networks
Ernst Althaus, Mohammad Sadeq Dousti, Stefan Kramer +1
A sum-product network (SPN) is a graphical model that allows several types of inferences to be drawn efficiently. There are two types of learning for SPNs: Learning the architectur…
Optimal Tree Decompositions Revisited: A Simpler Linear-Time FPT Algorithm
Ernst Althaus, Sarah Ziegler
In 1996, Bodlaender showed the celebrated result that an optimal tree decomposition of a graph of bounded treewidth can be found in linear time. The algorithm is based on an algori…
Fully Automatic Trunk Packing with Free Placements
Ernst Althaus, Peter Hachenberger
We present a new algorithm to compute the volume of a trunk according to the SAE J1100 standard. Our new algorithm uses state-of-the-art methods from computational geometry and fro…