Sciweavers

1469 search results - page 9 / 294
» Approximate polynomial decomposition
Sort
View
DSD
2007
IEEE
116views Hardware» more  DSD 2007»
15 years 6 months ago
Design Method for Numerical Function Generators Based on Polynomial Approximation for FPGA Implementation
This paper focuses on numerical function generators (NFGs) based on k-th order polynomial approximations. We show that increasing the polynomial order k reduces significantly the...
Shinobu Nagayama, Tsutomu Sasao, Jon T. Butler
INFORMATICALT
2010
99views more  INFORMATICALT 2010»
14 years 10 months ago
Security Analysis of Asymmetric Cipher Protocol Based on Matrix Decomposition Problem
The asymmetric cipher protocol, based on decomposition problem in matrix semiring M over semiring of natural numbers N is presented. The security of presented cipher protocol is ba...
Andrius Raulynaitis, Eligijus Sakalauskas, Saulius...
CORR
2008
Springer
80views Education» more  CORR 2008»
14 years 12 months ago
A Dual Polynomial for OR
We reprove that the approximate degree of the OR function on n bits is ( n). We consider a linear program which is feasible if and only if there is an approximate polynomial for ...
Robert Spalek