Abstract: This letter proposes two polynomial-time approximation algorithms for allocating servers to design a consistency-aware multi-server network for delay-sensitive applications. Each algorithm ...
Abstract: Computations on encrypted data can, in principle, be performed using homomorphic encryption. However, due to certain limitations, only algorithms based on polynomial functions can be ...
Either in polynomial-approximation or in lower-polynomial-eval (perhaps controlled by a new pipeline-level option as in #2137), we should have the ability to drop coefficients that have very small ...
1 Warwick Mathematics Institute, The University of Warwick, Coventry, United Kingdom 2 School of Computer and Information Engineering, Luoyang Institute of Science and Technology, Luoyang, China To ...
A method of near-minimax polynomial approximation is described. As a by-product, this method provides a formula for an estimate of the maximum error associated with a ...
Dominique Guillot, an associate professor in the University of Delaware's Department of Mathematical Sciences, was recently awarded the grant "Polynomial approximation in spaces of analytic functions" ...
The method of nested multiplication is commonly used in function evaluation routines to evaluate approximation polynomials. New polynomial evaluation methods have been developed in recent years which ...
ABSTRACT: The development of new technologies in smart cities is often hailed as it becomes a necessity to solve many problems like energy consumption and transportation. Wireless networks are part of ...
Add a description, image, and links to the polynomial-approximation topic page so that developers can more easily learn about it.
ABSTRACT: The celebrated Weierstrass Approximation Theorem (1885) heralded intermittent interest in polynomial approximation, which continues unabated even as of today. The great Russian mathematician ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback