Given a Euclidean graph G in Rd with n vertices and m edges we consider the problem of adding a shortcut such that the stretch factor of the resulting graph is minimized. Currentl...
Mohammad Farshi, Panos Giannopoulos, Joachim Gudmu...
Abstract. In this paper, we propose a new framework for the parametric verification of time Petri nets with stopwatches controlled by inhibitor arcs. We first introduce an extensio...
Louis-Marie Traonouez, Didier Lime, Olivier H. Rou...
In this paper we consider problems related to the sortedness of a data stream. First we investigate the problem of estimating the distance to monotonicity; given a sequence of len...
: As more information is made available online, users collect information in personal information spaces like bookmarks and emails. While most users feel that organizing these coll...
In this paper we analyse a hybrid approximation of functions on the sphere S2 R3 by radial basis functions combined with polynomials, with the radial basis functions assumed to be...