Sciweavers

6138 search results - page 451 / 1228
» High performance computing through parallel processing
Sort
View
VIS
2005
IEEE
110views Visualization» more  VIS 2005»
16 years 7 months ago
Prefiltered Gaussian Reconstruction for High-Quality Rendering of Volumetric Data sampled on a Body-Centered Cubic Grid
In this paper a novel high-quality reconstruction scheme is presented. Although our method is mainly proposed to reconstruct volumetric data sampled on an optimal Body-Centered Cu...
Balázs Csébfalvi
179
Voted
DAM
2007
107views more  DAM 2007»
15 years 6 months ago
Eliminating graphs by means of parallel knock-out schemes
In 1997 Lampert and Slater introduced parallel knock-out schemes, an iterative process on graphs that goes through several rounds. In each round of this process, every vertex elim...
Hajo Broersma, Fedor V. Fomin, Rastislav Kralovic,...
DAC
1997
ACM
15 years 10 months ago
A Parallel/Serial Trade-Off Methodology for Look-Up Table Based Decoders
A methodology for architecture exploration of look-up table based decoders is presented. For the degree of parallel processing a trade-off can be made by exploring system level an...
Claus Schneider
EUROPAR
2011
Springer
14 years 6 months ago
A Generic Parallel Collection Framework
Most applications manipulate structured data. Modern languages and platforms provide collection frameworks with basic data structures like lists, hashtables and trees. These data ...
Aleksandar Prokopec, Phil Bagwell, Tiark Rompf, Ma...
BIBE
2008
IEEE
142views Bioinformatics» more  BIBE 2008»
16 years 25 days ago
Optimizing performance, cost, and sensitivity in pairwise sequence search on a cluster of PlayStations
— The Smith-Waterman algorithm is a dynamic programming method for determining optimal local alignments between nucleotide or protein sequences. However, it suffers from quadrati...
Ashwin M. Aji, Wu-chun Feng