Sciweavers

663 search results - page 34 / 133
» A Parallel Algorithm for Enumerating Combinations
Sort
View
PC
2010
177views Management» more  PC 2010»
15 years 4 months ago
Parallel graph component labelling with GPUs and CUDA
Graph component labelling, which is a subset of the general graph colouring problem, is a computationally expensive operation that is of importance in many applications and simula...
Kenneth A. Hawick, Arno Leist, Daniel P. Playne
ALGORITHMICA
2005
195views more  ALGORITHMICA 2005»
15 years 5 months ago
Bit-Parallel Witnesses and Their Applications to Approximate String Matching
We present a new bit-parallel technique for approximate string matching. We build on two previous techniques. The first one, BPM [Myers, J. of the ACM, 1999], searches for a patte...
Heikki Hyyrö, Gonzalo Navarro
COLING
2010
15 years 28 days ago
Fast-Champollion: A Fast and Robust Sentence Alignment Algorithm
Sentence-level aligned parallel texts are important resources for a number of natural language processing (NLP) tasks and applications such as statistical machine translation and ...
Peng Li, Maosong Sun, Ping Xue
VLSISP
2010
119views more  VLSISP 2010»
15 years 19 days ago
Hardware Acceleration of HMMER on FPGAs
We propose a new parallelization scheme for the hmmsearch function of the HMMER software, in order to target FPGA technology. hmmsearch is a very compute intensive software for bio...
Steven Derrien, Patrice Quinton
COCOA
2007
Springer
16 years 4 days ago
On Threshold BDDs and the Optimal Variable Ordering Problem
Abstract. Many combinatorial optimization problems can be formulated as 0/1 integer programs (0/1 IPs). The investigation of the structure of these problems raises the following ta...
Markus Behle