Sciweavers

4541 search results - page 703 / 909
» Cache-Oblivious Algorithms and Data Structures
Sort
View
BMCBI
2010
62views more  BMCBI 2010»
15 years 7 months ago
Forward-time simulation of realistic samples for genome-wide association studies
Background: Forward-time simulations have unique advantages in power and flexibility for the simulation of genetic samples of complex human diseases because they can closely mimic...
Bo Peng, Christopher I. Amos
CGF
2010
147views more  CGF 2010»
15 years 7 months ago
Resampling Strategies for Deforming MLS Surfaces
Moving-Least-Squares (MLS) Surfaces undergoing large deformations need periodic regeneration of the point set (point-set resampling) so as to keep the point-set density quasi-unif...
Joao Paulo Gois, Gustavo C. Buscaglia
CGF
2008
217views more  CGF 2008»
15 years 7 months ago
A Flexible Kernel for Adaptive Mesh Refinement on GPU
We present a flexible GPU kernel for adaptive on-the-fly refinement of meshes with arbitrary topology. By simply reserving a small amount of GPU memory to store a set of adaptive ...
Tamy Boubekeur, Christophe Schlick
PPL
2008
75views more  PPL 2008»
15 years 7 months ago
Modeling the Performance of Communication Schemes on Network Topologies
This paper investigates the influence of the interconnection network topology of a parallel system on the delivery time of an ensemble of messages, called the communication scheme...
Jan Lemeire, Erik F. Dirkx, Walter Colitti
PC
2006
103views Management» more  PC 2006»
15 years 7 months ago
Parallel skeletons for manipulating general trees
Trees are important datatypes that are often used in representing structured data such as XML. Though trees are widely used in sequential programming, it is hard to write efficien...
Kiminori Matsuzaki, Zhenjiang Hu, Masato Takeichi