Sciweavers

968 search results - page 168 / 194
» A faster implementation of APlace
Sort
View
JPDC
2008
135views more  JPDC 2008»
13 years 7 months ago
Fast parallel GPU-sorting using a hybrid algorithm
This paper presents an algorithm for fast sorting of large lists using modern GPUs. The method achieves high speed by efficiently utilizing the parallelism of the GPU throughout th...
Erik Sintorn, Ulf Assarsson
VLSISP
2008
173views more  VLSISP 2008»
13 years 7 months ago
Fast Bit Gather, Bit Scatter and Bit Permutation Instructions for Commodity Microprocessors
Advanced bit manipulation operations are not efficiently supported by commodity word-oriented microprocessors. Programming tricks are typically devised to shorten the long sequence...
Yedidya Hilewitz, Ruby B. Lee
BMCBI
2010
101views more  BMCBI 2010»
13 years 7 months ago
Hidden Markov model speed heuristic and iterative HMM search procedure
Background: Profile hidden Markov models (profile-HMMs) are sensitive tools for remote protein homology detection, but the main scoring algorithms, Viterbi or Forward, require con...
L. Steven Johnson, Sean R. Eddy, Elon Portugaly
CVPR
2009
IEEE
2115views Computer Vision» more  CVPR 2009»
15 years 2 months ago
Real-Time O(1) Bilateral Filtering
We propose a new bilateral filtering algorithm with computational complexity invariant to filter kernel size, socalled O(1) or constant time in the literature. By showing that a...
Kar-Han Tan, Narendra Ahuja, Qingxiong Yang
ECCV
2006
Springer
14 years 9 months ago
Integrating Surface Normal Vectors Using Fast Marching Method
i Integration of surface normal vectors is a vital component in many shape reconstruction algorithms that require integrating surface normals to produce their final outputs, the de...
Jeffrey Ho, Jongwoo Lim, Ming-Hsuan Yang, David J....