This paper proposes a new methodology to model the distribution of finite size content to a group of users connected through an overlay network. Our methodology describes the distr...
The graph set T-colouring problem (GSTCP) generalises the classical graph colouring problem; it asks for the assignment of sets of integers to the vertices of a graph such that co...
Maintaining the stability of tracks on multiple targets in video over extended time periods remains a challenging problem. A few methods which have recently shown encouraging resul...
In this paper we introduce a new algorithm for model order reduction in the presence of parameter or process variation. Our analysis is performed using a graph interpretation of t...
Abstract. Cellular automata have been mainly studied for on very regular graphs carrying the cells (like lines or grids) and under synchronous dynamics (all cells update simultaneo...
Jean-Baptiste Rouquier, Damien Regnault, Eric Thie...