Dierence Bound Matrices (DBMs) are the most commonly used data structure for model checking timed automata. Since long they are being used in successful tools like Kronos or UPPAA...
This paper deals with the problem of non-linear landmark-based registration of CT (at two different instants of the breathing cycle, intermediate expirations) and PET images of th...
Sylvie Chambon, Antonio Moreno-Ingelmo, Anand P. S...
New mobile computing technologies and the increasing use of portable devices have pushed the development of the so-called context-aware applications. This new class of applications...
This multidisciplinary study focuses on the application and comparison of several topology preserving mapping models upgraded with some classifier ensemble and boosting techniques ...
Bruno Baruque, Emilio Corchado, Hujun Yin, Jordi R...
In this paper, we analyse the properties of the standard circular hidden Markov model (HMM) on 2D shape recognition. We point out the limitations of the circular HMMs and further ...