96 search results - page 7 / 20 » Improved Algorithms for Approximate String Matching (Extende... |
142
click to vote
AICT
2005
IEEE
15 years 8 months ago
2005
IEEE
The choice of the scheduling algorithm is a major design criteria of a switch. Whereas it is known that maximum weight matching algorithms guarantee the stability of an input queu...
125
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
ABSTRACT. In this paper modified variants of the sparse Fourier transform algorithms from [14] are presented which improve on the approximation error bounds of the original algorit...
ICDAR
1999
IEEE
15 years 7 months ago
1999
IEEE
Abstract. This paper describes a method for correction of optically read Devanagari character strings using a Hindi word dictionary. The word dictionary is partitioned in order to ...
147
click to vote
ISVC
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. We propose an improved shape matching algorithm that extends the work of Felzenszwalb [3]. In this approach, we use triangular meshes to represent deformable objects and ...
108
Voted
ICAIL
2003
ACM
15 years 8 months ago
2003
ACM
Name matching—recognizing when two different strings are likely to denote the same entity—is an important task in many legal information systems, such as case-management syste...