Sciweavers

722 search results - page 16 / 73
» Efficient Generation of Prime Numbers
Sort
View
281 views 137 votes 15 years 8 months ago  DAGM 2009»
Abstract. Approaches to visual navigation, e.g. used in robotics, require computationally efficient, numerically stable, and robust methods for the estimation of ego-motion. One of...
128 views 153 votes 15 years 3 months ago  MST 2002»
External sorting--the process of sorting a file that is too large to fit into the computer's internal memory and must be stored externally on disks--is a fundamental subroutin...
113 views 129 votes 15 years 4 months ago  BMCBI 2007»
Background: As compared with traditional transgene copy number detection technologies such as Southern blot analysis, real-time PCR provides a fast, inexpensive and high-throughpu...
180 views 135 votes 15 years 5 months ago  FPL 2008»
The objective of Molecular Dynamics (MD) simulations is to determine the shape of a molecule in a given biomolecular environment. These simulations are very demanding computationa...
116 views 212 votes 16 years 4 months ago  SIGMOD 2006»
Exact computation for aggregate queries usually requires large amounts of memory ? constrained in data-streaming ? or communication ? constrained in distributed computation ? and ...
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 ...