Sciweavers

819 search results - page 2 / 164
» Parallelization with Tree Skeletons
Sort
View
IPPS
2006
IEEE
13 years 11 months ago
Algorithmic skeletons for stream programming in embedded heterogeneous parallel image processing applications
Algorithmic skeletons can be used to write architecture independent programs, shielding application developers from the details of a parallel implementation. In this paper, we pre...
Wouter Caarls, Pieter P. Jonker, Henk Corporaal
IFL
2001
Springer
146views Formal Methods» more  IFL 2001»
13 years 10 months ago
Optimizations on Array Skeletons in a Shared Memory Environment
Map- and fold-like skeletons are a suitable abstractions to guide parallel program execution in functional array processing. However, when it comes to achieving high performance, i...
Clemens Grelck
CVGIP
2004
98views more  CVGIP 2004»
13 years 5 months ago
Topological volume skeletonization and its application to transfer function design
Topological volume skeletonization is a novel approach for automating transfer function design in visualization by extracting the topological structure of a volume dataset. The sk...
Shigeo Takahashi, Yuriko Takeshima, Issei Fujishir...
VVS
1998
IEEE
97views Visualization» more  VVS 1998»
13 years 10 months ago
Volume Animation Using the Skeleton Tree
In this paper, we describe a technique to animate volumes using a volumetric skeleton. The skeleton is computed from the actual volume, based on a reversible thinning procedure us...
Nikhil Gagvani, Deepak R. Kenchammana-Hosekote, De...
EUROPAR
2010
Springer
13 years 6 months ago
Exceptions for Algorithmic Skeletons
Abstract. Algorithmic Skeletons offer high-level abstractions for parallel programming based on recurrent parallelism patterns. Patterns can be combined and nested into more comple...
Mario Leyton, Ludovic Henrio, José M. Pique...