Sciweavers

722 search results - page 17 / 73
» Efficient Generation of Prime Numbers
Sort
View
107 views 151 votes 15 years 4 months ago  SIAMCOMP 2008»
Leslie Valiant recently proposed a theory of holographic algorithms. These novel algorithms achieve exponential speed-ups for certain computational problems compared to naive algo...
134 views 152 votes 15 years 10 months ago  CISS 2008»
—This paper improves on the best-known runtime and measurement bounds for a recently proposed Deterministic sublinear-time Sparse Fourier Transform algorithm (hereafter called DS...
77 views 119 votes 15 years 8 months ago  CMSB 2007»
This paper presents a simulation algorithm for the stochastic -calculus, designed for the efficient simulation of biological systems with large numbers of molecules. The cost of a ...
99 views 144 votes 15 years 3 months ago  JOC 2002»
We present a polynomial-time algorithm that provably recovers the signer's secret DSA key when a few bits of the random nonces k (used at each signature generation) are known ...
117 views 82 votes 15 years 4 months ago  MJ 2008»
Several commercial processors have selected the radix-8 multiplier architecture to increase their speed, thereby reducing the number of partial products. Radix-8 encoding reduces ...
225 views 157 votes 15 years 10 months ago  IPPS 2006»
Modern FPGA platforms provide the hardware and software infrastructure for building a bus-based System on Chip (SoC) that meet the applications requirements. The designer can cust...
163 views 136 votes 14 years 11 months ago  JDCTA 2010»
We implement a Korean syntactic analyzer which decreases many ambiguities in syntax parse trees using segmentation and semantic connection units. We use dependency grammar for par...
127 views 137 votes 15 years 2 months ago  JETC 2008»
With aggressive reductions in feature sizes and the integration of multiple functionalities on the same die, bottlenecks due to I/O pin limitations have become a severe issue in to...
76 views 123 votes 15 years 7 months ago  ICCAD 1991»
In a high level synthesis environment there is a strong need for flexible module generators. For the generation of regular structures efficient dedicated module generators can be ...
232 views 144 votes 16 years 3 months ago  DCC 2003»
Nguyen and Shparlinski recently presented a polynomial-time algorithm that provably recovers the signer's secret DSA key when a few bits of the random nonces k (used at each s...