2467 search results - page 259 / 494 » Finite State Machines |
169
click to vote
CLIN
2001
15 years 8 months ago
2001
This paper investigates the use of stemming for classification of Dutch (email) texts. We introduce a stemmer, which combines dictionary lookup (implemented efficiently as a finit...
171
click to vote
WSS
2001
15 years 8 months ago
2001
We investigate a new property of computing systems called weak stabilization. Although this property is strictly weaker than the well-known property of stabilization, weak stabiliz...
169
click to vote
ANLP
2000
15 years 8 months ago
2000
We present a divide-and-conquer strategy based on finite state technology for shallow parsing of realworld German texts. In a first phase only the topological structure of a sente...
189
click to vote
DAGSTUHL
2000
15 years 8 months ago
2000
Queueing network models have been extensively applied to represent and analyze resource sharing systems such as communication and computer systems and they have proved to be a pow...
163
click to vote
FBT
1998
15 years 8 months ago
1998
We build on work in designing modeling languages for hybrid systems in the development of CTA, the Cottbus Timed Automata. Our design features a facility to specify a hybrid system...