Sciweavers

27 search results - page 3 / 6
» Arbitrary Precision Arithmetic - SIMD Style
Sort
View
PR
2007
248views more  PR 2007»
13 years 7 months ago
A numerical recipe for accurate image reconstruction from discrete orthogonal moments
Recursive procedures used for sequential calculations of polynomial basis coefficients in discrete orthogonal moments produce unreliable results for high moment orders as a resul...
Bulent Bayraktar, Tytus Bernas, J. Paul Robinson, ...
PKC
1998
Springer
123views Cryptology» more  PKC 1998»
13 years 11 months ago
Two Efficient Algorithms for Arithmetic of Elliptic Curves Using Frobenius Map
In this paper, we present two efficient algorithms computing scalar multiplications of a point in an elliptic curve defined over a small finite field, the Frobenius map of which ha...
Jung Hee Cheon, Sung-Mo Park, Sangwoo Park, Daeho ...
SIGIR
2006
ACM
14 years 1 months ago
Find-similar: similarity browsing as a search tool
Search systems have for some time provided users with the ability to request documents similar to a given document. Interfaces provide this feature via a link or button for each d...
Mark D. Smucker, James Allan
DBPL
1991
Springer
76views Database» more  DBPL 1991»
13 years 11 months ago
A Functional DBPL Revealing High Level Optimizations
We present a functional DBPL in the style of FP that facilitates the definition of precise semantics and opens up opportunities for far-reaching optimizations. The language is int...
Martin Erwig, Udo W. Lipeck
ARITH
2007
IEEE
14 years 1 months ago
How to Ensure a Faithful Polynomial Evaluation with the Compensated Horner Algorithm
The compensated Horner algorithm improves the accuracy of polynomial evaluation in IEEE-754 floating point arithmetic: the computed result is as accurate as if it was computed wi...
Philippe Langlois, Nicolas Louvet