Sciweavers

1407 search results - page 255 / 282
» Join-Graph Propagation Algorithms
Sort
View
PLDI
2003
ACM
14 years 1 months ago
Points-to analysis using BDDs
This paper reports on a new approach to solving a subset-based points-to analysis for Java using Binary Decision Diagrams (BDDs). In the model checking community, BDDs have been s...
Marc Berndl, Ondrej Lhoták, Feng Qian, Laur...
FBIT
2007
IEEE
14 years 17 days ago
Mapping Genetic Influences on Brain Shape Using Multi-Atlas Fluid Image Alignment
In this pilot study, we developed a set of computer vision based surface segmentation and statistical shape analysis algorithms to study genetic influences on brain structure in a...
Meena Mani, Yi-Yu Chou, Natasha Lepore, Agatha D. ...
DELTA
2006
IEEE
14 years 11 days ago
Modified Montgomery Modular Multiplication Using 4: 2 Compressor and CSA Adder
The efficiency of the Public Key encryption systems like RSA and ECC can be improved with the adoption of a faster multiplication scheme. In this paper, Modified Montgomery multip...
Himanshu Thapliyal, Anvesh Ramasahayam, Vivek Redd...
BMCBI
2010
151views more  BMCBI 2010»
13 years 8 months ago
Misty Mountain clustering: application to fast unsupervised flow cytometry gating
Background: There are many important clustering questions in computational biology for which no satisfactory method exists. Automated clustering algorithms, when applied to large,...
István P. Sugár, Stuart C. Sealfon
FPL
2010
Springer
124views Hardware» more  FPL 2010»
13 years 6 months ago
Finding System-Level Information and Analyzing Its Correlation to FPGA Placement
One of the more popular placement algorithms for Field Programmable Gate Arrays (FPGAs) is called Simulated Annealing (SA). This algorithm tries to create a good quality placement ...
Farnaz Gharibian, Lesley Shannon, Peter Jamieson