Sciweavers

150 search results - page 10 / 30
» Parallel Generation of Pseudo-Random Sequences
Sort
View
HICSS
1995
IEEE
128views Biometrics» more  HICSS 1995»
14 years 1 months ago
Instruction Level Parallelism
Abstract. We reexamine the limits of parallelism available in programs, using runtime reconstruction of program data-flow graphs. While limits of parallelism have been examined in...
FPL
2008
Springer
150views Hardware» more  FPL 2008»
13 years 11 months ago
Compiler generated systolic arrays for wavefront algorithm acceleration on FPGAs
Wavefront algorithms, such as the Smith-Waterman algorithm, are commonly used in bioinformatics for exact local and global sequence alignment. These algorithms are highly computat...
Betul Buyukkurt, Walid A. Najjar
SC
2003
ACM
14 years 3 months ago
A Million-Fold Speed Improvement in Genomic Repeats Detection
This paper presents a novel, parallel algorithm for generating top alignments. Top alignments are used for finding internal repeats in biological sequences like proteins and gene...
John W. Romein, Jaap Heringa, Henri E. Bal
CEC
2008
IEEE
14 years 4 months ago
Generating massive high-quality random numbers using GPU
— Pseudo-random number generators (PRNG) have been intensively used in many stochastic algorithms in artificial intelligence, computer graphics and other scientific computing. ...
Wai-Man Pang, Tien-Tsin Wong, Pheng-Ann Heng
CONCUR
2007
Springer
14 years 4 months ago
Causal Message Sequence Charts
Scenario languages based on Message Sequence Charts (MSCs) have been widely studied in the last decade [21,20,3,15,12,19,14]. The high expressive power of MSCs renders many basic ...
Thomas Gazagnaire, Blaise Genest, Loïc H&eacu...