Let G and H be two graphs of order n. If we place copies of G and H on a common vertex set, how much or little can they be made to overlap? The aim of this paper is to provide som...
The dater equalities constitute a well-known tool which allows the description of Timed Event Graphs in the field of (max, +) algebra. This paper gives an equivalent model in the...
Abdelhak Guezzi, Philippe Declerck, Jean-Louis Boi...
Abstract. This paper presents a new approach to the problem of simultaneous location and segmentation of object in images. The main emphasis is done on the information provided by ...
We present in this paper a method to discover the set of webpages contained in a logical website, based on the link structure of the Web graph. Such a method is useful in the conte...
We show how the branching process approach can be used for the detection of illegal behaviors. Our study is based on the specification of properties in terms of testers that cover...