A continuous maximum flow problem finds the largest t such that div v = t F(x, y) is possible with a capacity constraint (v1, v2) ≤ c(x, y). The dual problem finds a minimum ...
Abstract-- A generalized Hamiltonian method (GHM) was recently proposed for the passivity test of hybrid descriptor systems [1]. This paper extends the GHM theory to its S-paramete...
We show that any family of sets uniformly definable in an ominimal structure has an extended compression scheme of size equal to the number of parameters in the defining formula. ...
In a previous paper we proposed Web-based language models relying on the possibility theory. These models explicitly represent the possibility of word sequences. In this paper we ...
Stanislas Oger, Vladimir Popescu, Georges Linar&eg...
Abstract. Tabulating elliptic curves has been carried out since the earliest days of machine computation in number theory. After some historical remarks, we report on significant r...