Results 31 to 40 of about 17,255,193 (320)
On Sharing, Memoization, and Polynomial Time (Long Version) [PDF]
, 2015 We study how the adoption of an evaluation mechanism with sharing and memoization impacts the class of functions which can be computed in polynomial time. We first show how a natural cost model in which lookup for an already computed value has no cost is
Avanzini, Martin, Lago, Ugo Dal
core +6 more sources
Interactive Verifiable Polynomial Evaluation [PDF]
IEEE Journal on Selected Areas in Information Theory, 2020 Cloud computing platforms have created the possibility for computationally limited users to delegate demanding tasks to strong but untrusted servers. Verifiable computing algorithms help build trust in such interactions by enabling the server to provide a proof of correctness of his results which the user can check very efficiently.
Saeid Sahraei +2 more
openaire +2 more sources
Fast Taylor polynomial evaluation for the computation of the matrix cosine
Journal of Computational and Applied Mathematics, 2019 In this work we introduce a new method to compute the matrix cosine. It is based on recent new matrix polynomial evaluation methods for the Taylor approximation and a mixed forward and backward error analysis.
J. Sastre +4 more
semanticscholar +1 more source
UNCERTAINTY EVALUATION METHOD FOR NONLINEAR SYSTEM TEST BASED ON POLYNOMIAL CHAOS EXPANSION
Jixie qiangdu, 2022 The uncertainty analysis of test results of nonlinear system shows the dispersion of test results. In this paper, an evaluation method of test uncertainty of nonlinear system based on polynomial chaos expansion is suggested.
YU HuiJie +5 more
doaj
Point-evaluation functionals on algebras of symmetric functions on $(L_\infty)^2$
Karpatsʹkì Matematičnì Publìkacìï, 2019 It is known that every continuous symmetric (invariant under the composition of its argument with each Lebesgue measurable bijection of $[0,1]$ that preserve the Lebesgue measure of measurable sets) polynomial on the Cartesian power of the complex Banach
T.V. Vasylyshyn
doaj +1 more source
Privacy-preserving data aggregation without secure channel: Multivariate polynomial evaluation [PDF]
2013 Proceedings IEEE INFOCOM, 2012 Much research has been conducted to securely outsource multiple parties' data aggregation to an untrusted aggregator without disclosing each individual's privately owned data, or to enable multiple parties to jointly aggregate their data while preserving
Taeho Jung +5 more
semanticscholar +1 more source
Accurate Evaluation of Polynomials in Legendre Basis
Journal of Applied Mathematics, 2014 This paper presents a compensated algorithm for accurate evaluation of a polynomial in Legendre basis. Since the coefficients of the evaluated polynomial are fractions, we propose to store these coefficients in two floating point numbers, such as double ...
Peibing Du, Hao Jiang, Lizhi Cheng
doaj +1 more source
Analysis of modified discretization methods for the measurement volume
Aviation, 2004 The analysis performed in the paper shows that the effectiveness of discretization methods depends on the accuracy of the evaluation of the parameters of local surface errors and on the characteristics of the regression polynomial describing them.
Darius Mariūnas, Vytautas Giniotis
doaj +1 more source
Classical Cryptographic Protocols in a Quantum World [PDF]
, 2015 Cryptographic protocols, such as protocols for secure function evaluation (SFE), have played a crucial role in the development of modern cryptography. The extensive theory of these protocols, however, deals almost exclusively with classical attackers. If
Hallgren, Sean, Smith, Adam, Song, Fang
core +2 more sources
Generating Operator of XXX or Gaudin Transfer Matrices Has Quasi-Exponential Kernel [PDF]
, 2013 Let $M$ be the tensor product of finite-dimensional polynomial evaluation Yangian $Y(gl_N)$-modules. Consider the universal difference operator $D = \sum_{k=0}^N (-1)^k T_k(u) e^{-k\partial_u}$ whose coefficients $T_k(u): M \to M$ are the XXX transfer ...
Mukhin, Evgeny +2 more
core +1 more source