926 search results - page 2 / 186 » Algorithms on Ideal over Complex Multiplication order |
MOC
1998
13 years 5 months ago
1998
We present a new algorithm for computing the structure of a finite abelian group, which has to store only a fixed, small number of group elements, independent of the group order....
DEBS
2008
ACM
13 years 7 months ago
2008
ACM
Complex Event Processing is an important technology for information systems with a broad application space ranging from supply chain management, systems monitoring, and stock mark...
STOC
2009
ACM
14 years 2 days ago
2009
ACM
We propose a fully homomorphic encryption scheme – i.e., a scheme that allows one to evaluate circuits over encrypted data without being able to decrypt. Our solution comes in t...
EVOW
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. Clustering still represents the most commonly used technique to analyze gene expression data—be it classical clustering approaches that aim at finding biologically rel...
CSR
2006
Springer
13 years 9 months ago
2006
Springer
Let Mq (n ) denote the number of multiplications required to compute the coefficients of the product of two polynomials of degree n over a q -element field by means of bilinear alg...