Add to ORKG(eng) Range reduction is a key point for getting accurate elementary function routines. We introduce a new algorithm that is fast for input arguments belonging to the most common domains, yet accurate over the full double precision range
When recognizing similar or close objects in a report, the accuracy of the recognition is very low w...
International audienceComputer platforms need implementations of elementary functions (exponential, ...
We improve the fastest known algorithm for approximate string matching. This algorithm can only be u...
Range-reduction is a key point for getting accurate elementary function routines. We introduce a new...
Range reduction is a key point for getting accurate elementary function routines. We introduce a new...
Abstract: A new range reduction algorithm, called Modular Range Reduction (MRR), brie y introduced b...
A new range reduction algorithm, called ModularRange Reduction (MRR), briefly introduced by the auth...
In several cases, the input argument of an elementary function evaluation is given bit-serially, mos...
Article dans revue scientifique avec comité de lecture.International audienceIn several cases, the i...
(eng) In several cases, the input argument of an elementary function evaluation is given bit-seriall...
Exportado OPUSMade available in DSpace on 2019-08-11T09:38:42Z (GMT). No. of bitstreams: 1 raphaeler...
AbstractIn a recent paper by Aberth and Schaefer (1992), it was shown how an implementation of range...
Sometimes, a function f of n variables can be represented as a com-position of two functions of fewe...
In this paper we present an algorithm for narrowing the constraint y = e x . The algorithm has be...
Sometimes, a function f of n variables can be represented as a composition of two functions of fewer...
When recognizing similar or close objects in a report, the accuracy of the recognition is very low w...
International audienceComputer platforms need implementations of elementary functions (exponential, ...
We improve the fastest known algorithm for approximate string matching. This algorithm can only be u...
Range-reduction is a key point for getting accurate elementary function routines. We introduce a new...
Range reduction is a key point for getting accurate elementary function routines. We introduce a new...
Abstract: A new range reduction algorithm, called Modular Range Reduction (MRR), brie y introduced b...
A new range reduction algorithm, called ModularRange Reduction (MRR), briefly introduced by the auth...
In several cases, the input argument of an elementary function evaluation is given bit-serially, mos...
Article dans revue scientifique avec comité de lecture.International audienceIn several cases, the i...
(eng) In several cases, the input argument of an elementary function evaluation is given bit-seriall...
Exportado OPUSMade available in DSpace on 2019-08-11T09:38:42Z (GMT). No. of bitstreams: 1 raphaeler...
AbstractIn a recent paper by Aberth and Schaefer (1992), it was shown how an implementation of range...
Sometimes, a function f of n variables can be represented as a com-position of two functions of fewe...
In this paper we present an algorithm for narrowing the constraint y = e x . The algorithm has be...
Sometimes, a function f of n variables can be represented as a composition of two functions of fewer...
When recognizing similar or close objects in a report, the accuracy of the recognition is very low w...
International audienceComputer platforms need implementations of elementary functions (exponential, ...
We improve the fastest known algorithm for approximate string matching. This algorithm can only be u...