3270 search results - page 219 / 654 » Approximate String Processing |
134
click to vote
LEC
2002
IEEE
15 years 8 months ago
2002
IEEE
This paper discusses the processing of negative verbal forms in Oriya in a deterministic Finite State Automaton. A morphologically agglutinative language like Oriya has ‘phrasal...
127
click to vote
ICS
2010
Tsinghua U.
15 years 7 months ago
2010
Tsinghua U.
We explore the intersection between an emerging class of architectures and a prominent workload: GPGPUs (General-Purpose Graphics Processing Units) and regular expression matching...
132
click to vote
AIEDAM
2000
15 years 2 months ago
2000
In designing a state space of possible designs is implied by the representation used and the computational processes that operate on that representation. GAs are a means of effect...
128
click to vote
COLING
2002
15 years 2 months ago
2002
There is no blank to mark word boundaries in Chinese text. As a result, identifying words is difficult, because of segmentation ambiguities and occurrences of unknown words. Conve...
155
click to vote
STACS
2005
Springer
15 years 8 months ago
2005
Springer
Cycle covering is a well-studied problem in computer science. In this paper, we develop approximation algorithms for variants of cycle covering problems which bound the size and/o...