Sciweavers

6129 search results - page 797 / 1226
» A parallel LLL algorithm
Sort
View
GPEM
2002
163views more  GPEM 2002»
15 years 6 months ago
Fast Ant Colony Optimization on Runtime Reconfigurable Processor Arrays
Ant Colony Optimization (ACO) is a metaheuristic used to solve combinatorial optimization problems. As with other metaheuristics, like evolutionary methods, ACO algorithms often sh...
Daniel Merkle, Martin Middendorf
JSAC
1998
126views more  JSAC 1998»
15 years 6 months ago
Iterative Decoding of Compound Codes by Probability Propagation in Graphical Models
Abstract—We present a unified graphical model framework for describing compound codes and deriving iterative decoding algorithms. After reviewing a variety of graphical models (...
Frank R. Kschischang, Brendan J. Frey
165
Voted
TCAD
1998
96views more  TCAD 1998»
15 years 6 months ago
Diagnosis of clustered faults and wafer testing
—A probabilistic diagnosis algorithm is presented for constant degree structures. The performance of the algorithm is analyzed under a negative binomial failure distribution to a...
Kaiyuan Huang, Vinod K. Agarwal, Krishnaiyan Thula...
CORR
2010
Springer
131views Education» more  CORR 2010»
15 years 5 months ago
Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding
: We develop a framework for solving polynomial equations with size constraints on solutions. We obtain our results by showing how to apply a technique of Coppersmith for finding ...
Henry Cohn, Nadia Heninger
ICCABS
2011
14 years 10 months ago
Towards accelerating molecular modeling via multi-scale approximation on a GPU
—Research efforts to analyze biomolecular properties contribute towards our understanding of biomolecular function. Calculating non-bonded forces (or in our case, electrostatic s...
Mayank Daga, Wu-chun Feng, Thomas Scogland