Sciweavers

363 search results - page 42 / 73
» Code Generation for Polynomial Multiplication
Sort
View
CRYPTO
2003
Springer
124views Cryptology» more  CRYPTO 2003»
14 years 25 days ago
Primality Proving via One Round in ECPP and One Iteration in AKS
On August 2002, Agrawal, Kayal and Saxena announced the first deterministic and polynomial time primality testing algorithm. For an input n, the AKS algorithm runs in heuristic t...
Qi Cheng
CORR
2010
Springer
72views Education» more  CORR 2010»
13 years 7 months ago
Minimizing weighted sum delay for one-to-many file transfer in peer-to-peer networks
Abstract-- This paper considers the problem of transferring a file from one source node to multiple receivers in a peer-to-peer (P2P) network. The objective is to minimize the weig...
Bike Xie, Mihaela van der Schaar, Richard D. Wesel
IEEECIT
2010
IEEE
13 years 6 months ago
A Recognizer of Rational Trace Languages
—The relevance of instruction parallelization and optimal event scheduling is currently increasing. In particular, because of the high amount of computational power available tod...
Federico Maggi
MICRO
2010
IEEE
175views Hardware» more  MICRO 2010»
13 years 5 months ago
Efficient Selection of Vector Instructions Using Dynamic Programming
Accelerating program performance via SIMD vector units is very common in modern processors, as evidenced by the use of SSE, MMX, VSE, and VSX SIMD instructions in multimedia, scien...
Rajkishore Barik, Jisheng Zhao, Vivek Sarkar
CRYPTO
2001
Springer
152views Cryptology» more  CRYPTO 2001»
14 years 3 days ago
Secure Distributed Linear Algebra in a Constant Number of Rounds
Consider a network of processors among which elements in a finite field K can be verifiably shared in a constant number of rounds. Assume furthermore constant-round protocols ar...
Ronald Cramer, Ivan Damgård