The subgraph isomorphism problem consists in deciding if there exists a copy of a pattern graph in a target graph. We introduce in this paper a global constraint and an associated ...
This paper introduces and studies a new type of logical construction, which allows to combine various non-classical propositional logics with the temporal or modal background. The...
Affective computing has proven to be a viable field of research comprised of a large number of multidisciplinary researchers resulting in work that is widely published. The majori...
We propose structured models for image labeling that take into account the dependencies among the image labels explicitly. These models are more expressive than independent label ...
The outage probability limit is a fundamental and achievable lower bound on the word error rate of coded communication systems affected by fading. This limit is mainly determined ...
Dieter Duyck, Joseph Jean Boutros, Marc Moeneclaey