Sciweavers

57 search results - page 2 / 12
» Understanding the efficiency of GPU algorithms for matrix-ma...
Sort
View
BMCBI
2008
211views more  BMCBI 2008»
13 years 5 months ago
CUDA compatible GPU cards as efficient hardware accelerators for Smith-Waterman sequence alignment
Background: Searching for similarities in protein and DNA databases has become a routine procedure in Molecular Biology. The Smith-Waterman algorithm has been available for more t...
Svetlin Manavski, Giorgio Valle
PPL
2010
117views more  PPL 2010»
12 years 12 months ago
Neighborhood Structures for GPU-Based Local Search Algorithms
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
Thé Van Luong, Nouredine Melab, El-Ghazali ...
IPPS
2010
IEEE
13 years 3 months ago
Large neighborhood local search optimization on graphics processing units
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
Thé Van Luong, Nouredine Melab, El-Ghazali ...
COLING
2010
13 years 6 days ago
Improving the Quality of Text Understanding by Delaying Ambiguity Resolution
Text Understanding systems often commit to a single best interpretation of a sentence before analyzing subsequent text. This interpretation is chosen by resolving ambiguous altern...
Doo Soon Kim, Ken Barker, Bruce W. Porter

Presentation
439views
11 years 11 months ago
Efficient Evaluation Methods of Elementary Functions Suitable for SIMD Computation
Data-parallel architectures like SIMD (Single Instruction Multiple Data) or SIMT (Single Instruction Multiple Thread) have been adopted in many recent CPU and GPU architectures. Al...