Sciweavers

558 search results - page 20 / 112
» Trees and Matchings
Sort
View
INFOCOM
2010
IEEE
15 years 4 months ago
High Performance Dictionary-Based String Matching for Deep Packet Inspection
—Dictionary-Based String Matching (DBSM) is used in network Deep Packet Inspection (DPI) applications virus scanning [1] and network intrusion detection [2]. We propose the Pipel...
Yi-Hua Edward Yang, Hoang Le, Viktor K. Prasanna
138
Voted
NAACL
2003
15 years 7 months ago
Sentence Level Discourse Parsing using Syntactic and Lexical Information
We introduce two probabilistic models that can be used to identify elementary discourse units and build sentence-level discourse parse trees. The models use syntactic and lexical ...
Radu Soricut, Daniel Marcu
CC
2005
Springer
123views System Software» more  CC 2005»
15 years 11 months ago
XML Goes Native: Run-Time Representations for Xtatic
Abstract. Xtatic is a lightweight extension of C offering native support for statically typed XML processing. XML trees are built-in values in Xtatic, and static analysis of the t...
Vladimir Gapeyev, Michael Y. Levin, Benjamin C. Pi...
187
Voted
DBPL
2005
Springer
135views Database» more  DBPL 2005»
15 years 11 months ago
Type-Based Optimization for Regular Patterns
Pattern matching mechanisms based on regular expressions feature in a number of recent languages for processing XML. The flexibility of these mechanisms demands novel approaches ...
Michael Y. Levin, Benjamin C. Pierce
ESOP
2009
Springer
15 years 9 months ago
Verified, Executable Parsing
We describe the mechanisation of SLR parsing, covering background properties of context-free languages and grammars, as well as the construction of an SLR automaton. Among the vari...
Aditi Barthwal, Michael Norrish