Results 251 to 260 of about 17,255,193 (320)

Integrating Distance Correlation and Adaptive Weighting with RBF Kernel Transformations: A Novel Feature Selection Framework with Application to ECG Arrhythmia Detection. [PDF]

Bioengineering (Basel)
Fira M, Fira L.
europepmc   +1 more source

Exploring novel semi-inner product reproducing Kernels in Banach space for robust Kernel methods. [PDF]

PLoS One
Ding Y, Zhao Y, Pei Y.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Fast Polynomial Evaluation for Correctly Rounded Elementary Functions using the RLIBM Approach

IEEE/ACM International Symposium on Code Generation and Optimization, 2023
This paper proposes fast polynomial evaluation methods for correctly rounded elementary functions generated using our RLibm approach. The resulting functions produce correct results for all inputs with multiple representations and rounding modes.
Mridul Aanjaneya, Santosh Nagarakatte
semanticscholar   +1 more source

Oblivious transfer and polynomial evaluation

Proceedings of the thirty-first annual ACM symposium on Theory of Computing, 1999
Moni Naor, Benny Pinkas
openaire   +2 more sources

On the Evaluation of Polynomial Coefficients

Numerical Algorithms, 2003
The problem of evaluation of polynomial coefficients with given zeros of a polynomial (inverse problem to calculating the zeros knowing the polynomial coefficients) is considered and it is shown that the accuracy of the computed coefficients depends on the order in which the zeros are introduced. An ordering that enhances the accuracy is presented.
Daniela Calvetti, Lothar Reichel
openaire   +2 more sources

Fast evaluation of polynomials and inverses of polynomials

Proceedings of IEEE 11th Symposium on Computer Arithmetic, 2002
The parallel and online (i.e., digit serial, most significant digit first) evaluation of polynomials and inverses of polynomials is dealt with. New algorithms and architectures are proposed for such evaluations. A 3-D implementation model is presented. >
Xavier Merrheim, Jean-Michel Muller, Hong-Jin Yeh   +2 more
openaire   +1 more source

Polynomial evaluation with scaling

ACM Transactions on Mathematical Software, 1990
To overcome difficulties in polynomial evaluation caused by overflow or unnecessary underflow, we introduce a simple scaling procedure into Horner's method.
Eldon R. Hansen, Merrell L. Patrick, Richard L. C. Wang   +2 more
openaire   +1 more source

Precision Adaptation for Fast and Accurate Polynomial Evaluation Generation

IEEE International Conference on Application-Specific Systems, Architectures, and Processors, 2019
Polynomial evaluation is a critical part of the efficient floating-point approximation of elementary functions, in software as well as in FPGA-based systems.
Nicolas Brunie, C. Lauter, G. Revy
semanticscholar   +1 more source

Oblivious polynomial evaluation

Journal of Computer Science and Technology, 2004
The problem of two-party oblivious polynomial evaluation (OPE) is studied, where one party (Alice) has a polynomial P(x) and the other party (Bob) with an input x wants to learn P(x) in such an oblivious way that Bob obtains P(x) without learning any additional information about P except what is implied by P(x) and Alice does not know Bob's input x ...
Hong-Da Li 0001, Dongyao Ji, Dengguo Feng, Bao Li 0001   +3 more
openaire   +1 more source