Sciweavers

5 search results - page 1 / 1
» Fast Equal-Area Mapping of the (Hemi)Sphere using SIMD
Sort
View
JGTOOLS
2008
109views more  JGTOOLS 2008»
13 years 4 months ago
Fast Equal-Area Mapping of the (Hemi)Sphere using SIMD
We present a fast vectorized implementation of a transform that maps points in the unit square to the surface of the sphere, while preserving fractional area. The mapping uses the ...
Petrik Clarberg
BMCBI
2011
12 years 8 months ago
Faster Smith-Waterman database searches with inter-sequence SIMD parallelisation
Background: The Smith-Waterman algorithm for local sequence alignment is more sensitive than heuristic methods for database searching, but also more time-consuming. The fastest ap...
Torbjørn Rognes
EGH
2009
Springer
13 years 2 months ago
Fast minimum spanning tree for large graphs on the GPU
Graphics Processor Units are used for many general purpose processing due to high compute power available on them. Regular, data-parallel algorithms map well to the SIMD architect...
Vibhav Vineet, Pawan Harish, Suryakant Patidar, P....
IJCV
2002
227views more  IJCV 2002»
13 years 4 months ago
Calculating Dense Disparity Maps from Color Stereo Images, an Efficient Implementation
Abstract-- This paper presents an efficient implementation for correlation based stereo. Research in this area can roughly be divided in two classes: improving accuracy regardless ...
Karsten Mühlmann, Dennis Maier, Jürgen H...
CODES
2003
IEEE
13 years 10 months ago
A fast parallel reed-solomon decoder on a reconfigurable architecture
This paper presents a software implementation of a very fast parallel Reed-Solomon decoder on the second generation of MorphoSys reconfigurable computation platform, which is targ...
Arezou Koohi, Nader Bagherzadeh, Chengzi Pan