Results 1 to 10 of about 17,255,193 (320)
Efficient Non-Interactive Discrete ReLU over CKKS Using Interpolation Look-Up Table [PDF]
EntropyDeploying neural networks on encrypted data requires efficient evaluation of nonlinear activations, especially the ReLU function, without decryption.
Zhigang Chen, Xinxia Song, Liqun Chen
doaj +2 more sources
Oblivious Polynomial Evaluation [PDF]
SIAM Journal on Computing, 2006 Oblivious polynomial evaluation is a protocol involving two parties, a sender whose input is a polynomial P, and a receiver whose input is a value $\alpha$. At the end of the protocol the receiver learns $P(\alpha)$ and the sender learns nothing. We describe efficient constructions for this protocol, which are based on new intractability assumptions ...
Moni Naor, Benny Pinkas
openaire +2 more sources
Oblivious evaluation of multivariate polynomials
Journal of Mathematical Cryptology, 2013 One of the fundamental problems of multi-party computation is Oblivious Polynomial Evaluation. In that problem, that was introduced by Naor and Pinkas, Alice has a polynomial and Bob has a point .
Tassa Tamir +2 more
doaj +2 more sources
Fast polynomial evaluation and composition [PDF]
CoRR, 2013 The library \emph{fast\_polynomial} for Sage compiles multivariate polynomials for subsequent fast evaluation. Several evaluation schemes are handled, such as H\"orner, divide and conquer and new ones can be added easily.
Moroz, Guillaume
core +5 more sources
Accurate Goertzel Algorithm: Error Analysis, Validations and Applications
Mathematics, 2022 The Horner and Goertzel algorithms are frequently used in polynomial evaluation. Each of them can be less expensive than the other in special cases. In this paper, we present a new compensated algorithm to improve the accuracy of the Goertzel algorithm ...
Chuanying Li +5 more
doaj +1 more source
Rigid continuation paths II. structured polynomial systems
Forum of Mathematics, Pi, 2023 This work studies the average complexity of solving structured polynomial systems that are characterised by a low evaluation cost, as opposed to the dense random model previously used.
Peter Bürgisser +2 more
doaj +1 more source
More connections between the matching polynomial and the chromatic polynomial
AKCE International Journal of Graphs and Combinatorics, 2019 The connection between the matching polynomial and the chromatic polynomial for triangle-free graphs was revealed in the work of Farrell and Whitehead. We extend this result to all graph by mirroring the corresponding result of Godsil and Gutman for the ...
Beatriz Carely Luna-Olivera +2 more
doaj +2 more sources
Fast beampattern evaluation by polynomial rooting [PDF]
Advances in Radio Science, 2011 Current automotive radar systems measure the distance, the relative velocity and the direction of objects in their environment. This information enables the car to support the driver.
P. Häcker, S. Uhlich, B. Yang
doaj +1 more source
Efficient Evaluation of Matrix Polynomials beyond the Paterson–Stockmeyer Method
Mathematics, 2021 Recently, two general methods for evaluating matrix polynomials requiring one matrix product less than the Paterson–Stockmeyer method were proposed, where the cost of evaluating a matrix polynomial is given asymptotically by the total number of matrix ...
Jorge Sastre, Javier Ibáñez
doaj +1 more source
Classification of raw milk composition and somatic cell count in water buffaloes with support vector machines [PDF]
Kafkas Universitesi Veteriner Fakültesi Dergisi, 2020 The study investigates the classification of milk quality with support vector machines (SVM) using the raw milk composition and somatic cell count (SCC) data on buffalos.
Yalcin TAHTALI
doaj +1 more source