We investigate the complexity of performing updates on probabilistic XML data for various classes of probabilistic XML documents of different succinctness. We consider two elemen...
— Although efficient processing of probabilistic databases is a well-established field, a wide range of applications are still unable to benefit from these techniques due to t...
We present an algorithm which partitions a data set in two parts with equal size and experimentally nearly the same distribution measured through the likelihood of a Parzen kernel ...
In this paper, we present a novel algorithm for partial
intrinsic symmetry detection in 3D geometry. Unlike previous
work, our algorithm is based on a conceptually simple
and st...
Ruxandra Lasowski, Art Tevs, Hans-Peter Seidel, Mi...
In this paper, we present a general machine learning approach to the problem of deciding when to share probabilistic beliefs between agents for distributed monitoring. Our approac...