Sciweavers

583 search results - page 6 / 117
» New algorithms for efficient parallel string comparison
Sort
View
ARITH
1999
IEEE
13 years 11 months ago
A Comparison of Three Rounding Algorithms for IEEE Floating-Point Multiplication
A new IEEE compliant floating-point rounding algorithm for computing the rounded product from a carry-save representation of the product is presented. The new rounding algorithm i...
Guy Even, Peter-Michael Seidel
PRL
2002
91views more  PRL 2002»
13 years 7 months ago
StrCombo: combination of string recognizers
In this paper, we contribute a new paradigm of combining string recognizers and propose generic frameworks for hierarchical and parallel combination of multiple string recognizers...
Xiangyun Ye, Mohamed Cheriet, Ching Y. Suen
MOC
1998
107views more  MOC 1998»
13 years 7 months ago
A new parallel chasing algorithm for transforming arrowhead matrices to tridiagonal form
Rutishauser, Gragg and Harrod and finally H.Y. Zha used the same class of chasing algorithms for transforming arrowhead matrices to tridiagonal form. Using a graphical theoretical...
Suely Oliveira
BMCBI
2010
86views more  BMCBI 2010»
13 years 7 months ago
Fast motif recognition via application of statistical thresholds
Background: Improving the accuracy and efficiency of motif recognition is an important computational challenge that has application to detecting transcription factor binding sites...
Christina Boucher, James King
SIGIR
1996
ACM
13 years 11 months ago
Phonetic String Matching: Lessons from Information Retrieval
Phonetic matching is used in applications such as name retrieval, where the spelling of a name is used to identify other strings that are likely to be of similar pronunciation. In...
Justin Zobel, Philip W. Dart