Helly's theorem says that, if every d+1 elements of a given finite set of convex objects in Rd have a common point, there is a point common to all of the objects in the set. I...
Given a graph on n vertices which is the union of two comparability graphs on the same vertex set, it always contains a clique or independent set of size n 1 3 . On the other hand...
This paper proposes a novel technique, called instruction set limitation, to strengthen the resilience of software diversification against collusion attacks. Such attacks require a...
Bjorn De Sutter, Bertrand Anckaert, Jens Geiregat,...
This paper presents a novel extension of Hidden Markov Models (HMMs): type-2 fuzzy HMMs (type-2 FHMMs). The advantage of this extension is that it can handle both randomness and f...