This paper is part of a project to match descriptions of real-world instances and probabilistic models, both of which can be described at mulvel of abstraction and detail. We use ...
Abstract— A core challenge in probabilistic mapping is to extract meaningful uncertainty information from data registration methods. While this has been investigated in ICP-based...
Schema matching is the problem of finding correspondences (mapping rules, e.g. logical formulae) between heterogeneous schemas e.g. in the data exchange domain, or for distribute...
Over the last two decades a large number of algorithms has been developed for regulatory motif finding. Here we show how many of these algorithms, especially those that model bind...
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...