—In this paper we present two algorithms that automatically calculate linear expressions for Time Series. To estimate the maximum number of terms of the linear expression and the...
Pedro Flores, Carlos Anaya, Hector M. Ramirez, Lui...
It was open for more than eight years to obtain an algorithm for computing the convex hull of a set of n sorted points in sub-logarithmic time on a reconfigurable mesh of size pn ...
In this article, we focus on numerical algorithms for which, in practice, parallelism and accuracy do not cohabit well. In order to increase parallelism, expressions are reparsed,...
Philippe Langlois, Matthieu Martel, Laurent Th&eac...
Probabilistic techniques are widely used in the analysis of algorithms to estimate the computational complexity of algorithms or a computational problem. Traditionally, such analys...
Abstract In this paper we focus on property-preserving preorders between timed game automata and their application to control of partially observable systems. We define timed weak ...
Peter Bulychev, Thomas Chatain, Alexandre David, K...