Probabilistic timed automata, a variant of timed automata extended with discrete probability distributions, is a specification formalism suitable for describing both nondeterminis...
Marta Z. Kwiatkowska, Gethin Norman, David Parker,...
To date many methods and programs for automatic text recognition exist. However there are no effective text recognition systems for graphic documents. Graphic documents usually con...
Alexander F. Gelbukh, Serguei Levachkine, Sang-Yon...
— In this paper we present a cross-domain application for ambient and health monitoring. The system architecture is intended to be openly extensible in order to fulfil unanticipa...
Fabio Vergari, Sara Bartolini, Federico Spadini, A...
Tuning applications for multi-core systems involve subtle concepts and target-dependent optimizations. New languages are being designed to express concurrency and locality without...
Cupertino Miranda, Philippe Dumont, Albert Cohen, ...
This paper presents a simple and effective nonparametric approach to the problem of image parsing, or labeling image regions (in our case, superpixels produced by bottom-up segmen...