Sciweavers

142 search results - page 10 / 29
» Efficient Parallel String Comparison
Sort
View
STRINGOLOGY
2004
13 years 8 months ago
A Note on Bit-Parallel Alignment Computation
Abstract. The edit distance between strings A and B is defined as the minimum number of edit operations needed in converting A into B or vice versa. Typically the allowed edit oper...
Heikki Hyyrö
JMLR
2008
148views more  JMLR 2008»
13 years 7 months ago
Linear-Time Computation of Similarity Measures for Sequential Data
Efficient and expressive comparison of sequences is an essential procedure for learning with sequential data. In this article we propose a generic framework for computation of sim...
Konrad Rieck, Pavel Laskov
PVM
2010
Springer
13 years 5 months ago
Implementing MPI on Windows: Comparison with Common Approaches on Unix
Commercial HPC applications are often run on clusters that use the Microsoft Windows operating system and need an MPI implementation that runs efficiently in the Windows environmen...
Jayesh Krishna, Pavan Balaji, Ewing L. Lusk, Rajee...
ENC
2004
IEEE
13 years 11 months ago
Comparison of Scheduling Heuristics for Grid Resource Broker
In this paper, we consider parallel tasks scheduling problems for hierarchical decentralized systems that consist of homogeneous computational resources such as clusters, PCs and ...
Sergey Zhuk, Andrey Chernykh, Arutyun Avetisyan, S...
DATE
2008
IEEE
105views Hardware» more  DATE 2008»
14 years 1 months ago
Comparison of Boolean Satisfiability Encodings on FPGA Detailed Routing Problems
We compare 12 new encodings for representing of FPGA detailed routing problems as equivalent Boolean Satisfiability (SAT) problems against the only 2 previously used encodings. We...
Miroslav N. Velev, Ping Gao 0002