Sciweavers

3690 search results - page 176 / 738
» Computation with classical sequents
Sort
View
109
Voted
AAECC
2010
Springer
136views Algorithms» more  AAECC 2010»
15 years 22 days ago
New recombination algorithms for bivariate polynomial factorization based on Hensel lifting
Abstract. We present new faster deterministic and probabilistic recombination algorithms to compute the irreducible decomposition of a bivariate polynomial via the classical Hensel...
Grégoire Lecerf
87
Voted
ITA
2007
15 years 15 days ago
Correct rounding of algebraic functions
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...
Nicolas Brisebarre, Jean-Michel Muller
81
Voted
TNN
2008
88views more  TNN 2008»
15 years 15 days ago
A Fault-Tolerant Regularizer for RBF Networks
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...
Chi-Sing Leung, J. P. F. Sum
LOGCOM
2007
130views more  LOGCOM 2007»
15 years 14 days ago
A Logic for Concepts and Similarity
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,...
75
Voted
INFORMATICALT
2010
91views more  INFORMATICALT 2010»
14 years 11 months ago
An Expansion of the Neural Network Theory by Introducing Hebb Postulate
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...
Algis Garliauskas