The regularity lemma of Szemer´edi gives a concise approximate description of a graph via a so called regular-partition of its vertex set. In this paper we address the following ...
The Viewing Graph [1] represents several views linked by the corresponding fundamental matrices, estimated pairwise. Given a Viewing Graph, the tuples of consistent camera matrices...
Here we present a simple method based on graph spectral properties to automatically partition multi-domain proteins into individual domains. The identification of structural domain...
This paper presents an innovative model of a program’s internal behavior over a set of test inputs, called the probabilistic program dependence graph (PPDG), that facilitates pr...
Workflow and business process modeling approaches have become essential for designing service collaborations when developing SOA-based systems. To derive actual executable busines...
Carsten Lohmann, Joel Greenyer, Juanjuan Jiang, Ta...