363 search results - page 9 / 73 » Code Generation for Polynomial Multiplication |
ICPR
2000
IEEE
14 years 8 months ago
2000
IEEE
This work presents a new approach to contour representation and coding. It consists of an improved fitting of high-degree (4th to 18th ) implicit polynomials (IPs) to the contour,...
ECCC
1998
13 years 7 months ago
1998
Impagliazzo and Wigderson IW97] have recently shown that if there exists a decision problem solvable in time 2O(n) and having circuit complexity 2 (n) (for all but nitely many n) ...
HICSS
2007
IEEE
14 years 1 months ago
2007
IEEE
The problems involved in the development of user interfaces become even more severe through the ubiquitous use of a variety of devices such as PCs, mobile phones and PDAs. Each of...
CANS
2011
Springer
12 years 7 months ago
2011
Springer
In this paper, we explore fast algorithms for computing on encrypted polynomials. More specifically, we describe efficient algorithms for computing the Discrete Fourier Transform,...
LCTRTS
2004
Springer
14 years 26 days ago
2004
Springer
We present a polynomial upper bound for flattening of UML statecharts. An efficient flattening technique is derived and implemented in SCOPE—a code generator targeting constra...