56 citations · 118 across the 19 of their papers we have counts for
Showing 2012 · cs.DSShow all
2 papers · 2 filters
cs.DS2012
On Finding Optimal Polytrees
Serge Gaspers, Mikko Koivisto, Mathieu Liedloff +2
Inferring probabilistic networks from data is a notoriously difficult task. Under various goodness-of-fit measures, finding an optimal network is NP-hard, even if restricted to pol…
cs.DS2012★ 1 cited
Fast Monotone Summation over Disjoint Sets
Petteri Kaski, Mikko Koivisto, Janne H. Korhonen
We study the problem of computing an ensemble of multiple sums where the summands in each sum are indexed by subsets of size of an -element ground set. More precisely, the t…