Generalizing the concept of a Reeb graph, the Reeb space of a multivariate continuous mapping identifies points of the domain that belong to a common component of the preimage of ...
A simple 2-matching in a graph is a subgraph all of whose nodes have degree 1 or 2. A simple 2-matching is called k-restricted if every connected component has > k edges. We co...
A new method named Landmark Model Matching was recently proposed for fully automatic face recognition. It was inspired by Elastic Bunch Graph Matching and Active Shape Model. Landm...
Let Qn be a hypercube of dimension n, that is, a graph whose vertices are binary n-tuples and two vertices are adjacent iff the corresponding n-tuples differ in exactly one posit...
Maria Axenovich, Heiko Harborth, Arnfried Kemnitz,...
We present a new method to show concentration of the upper tail of random variables that can be written as sums of variables with plenty of independence. We compare our method with...