Sciweavers

96 search results - page 7 / 20
» Designing a Coprocessor for Recurrent Computations
Sort
View
95
Voted
GLVLSI
2007
IEEE
166views VLSI» more  GLVLSI 2007»
15 years 1 months ago
Efficient pipelining for modular multiplication architectures in prime fields
This paper presents a pipelined architecture of a modular Montgomery multiplier, which is suitable to be used in public key coprocessors. Starting from a baseline implementation o...
Nele Mentens, Kazuo Sakiyama, Bart Preneel, Ingrid...
BMCBI
2010
109views more  BMCBI 2010»
14 years 9 months ago
FPGA acceleration of the phylogenetic likelihood function for Bayesian MCMC inference methods
Background: Likelihood (ML)-based phylogenetic inference has become a popular method for estimating the evolutionary relationships among species based on genomic sequence data. Th...
Stephanie Zierke, Jason D. Bakos
ARITH
2005
IEEE
15 years 3 months ago
Efficient Mapping of Addition Recurrence Algorithms in CMOS
Efficient adder design requires proper selection of a recurrence algorithm and its realization. Each of the algorithms: Weinberger’s, Ling’s and Doran’s were analyzed for it...
Bart R. Zeydel, Theo T. J. H. Kluter, Vojin G. Okl...
90
Voted
SBRN
2008
IEEE
15 years 3 months ago
Imitation Learning of an Intelligent Navigation System for Mobile Robots Using Reservoir Computing
The design of an autonomous navigation system for mobile robots can be a tough task. Noisy sensors, unstructured environments and unpredictability are among the problems which mus...
Eric A. Antonelo, Benjamin Schrauwen, Dirk Strooba...
HPDC
1997
IEEE
15 years 1 months ago
Supporting Parallel Applications on Clusters of Workstations: The Intelligent Network Interface Approach
This paper presents a novel networking architecture designed for communication intensive parallel applications running on clusters of workstations (COWs) connected by highspeed ne...
Marcel-Catalin Rosu, Karsten Schwan, Richard Fujim...