Sciweavers

58 search results - page 6 / 12
» Implementation and Application of Automata in String Process...
Sort
View
ICNP
2007
IEEE
15 years 3 months ago
HEXA: Compact Data Structures for Faster Packet Processing
—Data structures representing directed graphs with edges labeled by symbols from a finite alphabet are used to implement packet processing algorithms used in a variety of network...
Sailesh Kumar, Jonathan S. Turner, Patrick Crowley...
ICC
2011
IEEE
237views Communications» more  ICC 2011»
13 years 9 months ago
Reorganized and Compact DFA for Efficient Regular Expression Matching
—Regular expression matching has become a critical yet challenging technique in content-aware network processing, such as application identification and deep inspection. To meet ...
Kai Wang, Yaxuan Qi, Yibo Xue, Jun Li
ACL
2010
14 years 7 months ago
Efficient Inference through Cascades of Weighted Tree Transducers
Weighted tree transducers have been proposed as useful formal models for representing syntactic natural language processing applications, but there has been little description of ...
Jonathan May, Kevin Knight, Heiko Vogler
ICFEM
2003
Springer
15 years 2 months ago
Generic Interacting State Machines and Their Instantiation with Dynamic Features
Interacting State Machines (ISMs) are used to model reactive systems and to express and verify their properties. They can be seen both as automata exchanging messages simultaneousl...
David von Oheimb, Volkmar Lotz
SIGIR
2003
ACM
15 years 2 months ago
Transliteration of proper names in cross-language applications
Translation of proper names is generally recognized as a significant problem in many multi-lingual text and speech processing applications. Even when large bilingual lexicons use...
Paola Virga, Sanjeev Khudanpur