59 search results - page 6 / 12 » Fast Computation on Encrypted Polynomials and Applications |
109
Voted
PG
2007
IEEE
15 years 9 months ago
2007
IEEE
In this paper, we describe a method for exact evaluation of a limit mesh defined via subdivision on a uniform grid of any size. Other exact evaluation technique either restrict t...
116
Voted
ISSAC
2009
Springer
15 years 10 months ago
2009
Springer
An Artin-Schreier tower over the finite field Fp is a tower of field extensions generated by polynomials of the form Xp − X − α. Following Cantor and Couveignes, we give a...
132
Voted
IEICET
2010
14 years 10 months ago
2010
Polar Fourier Descriptor(PFD) and Spherical Fourier Descriptor(SFD) are rotation invariant feature descriptors for two dimensional(2D) and three dimensional(3D) image retrieval an...
128
click to vote
FOCS
2000
IEEE
15 years 7 months ago
2000
IEEE
We give new bounds on the circuit complexity of the quantum Fourier transform (QFT). We give an upper bound of Ç´ÐÓ Ò · ÐÓ ÐÓ ´½ µµ on the circuit depth for computin...
133
click to vote
MOC
2002
15 years 3 months ago
2002
The spectral method with discrete spherical harmonics transform plays an important role in many applications. In spite of its advantages, the spherical harmonics transform has a dr...