Abstract. We present new faster deterministic and probabilistic recombination algorithms to compute the irreducible decomposition of a bivariate polynomial via the classical Hensel...
We explicit the link between the computer arithmetic problem of providing correctly rounded algebraic functions and some diophantine approximation issues. This allows to get bounds...
In classical training methods for node open fault, we need to consider many potential faulty networks. When the multinode fault situation is considered, the space of potential faul...
Categorisation of objects into classes is currently supported by (at least) two ‘orthogonal’ methods. In logic-based approaches, classifications are defined through ontologi...
Mikhail Sheremet, Dmitry Tishkovsky, Frank Wolter,...
In the presented paper, some issues of the fundamental classical mechanics theory in the sense of Ising physics are introduced into the applied neural network area. The expansion o...