151 search results - page 6 / 31 » Efficient regular expression evaluation: theory to practice |
100
click to vote
ICDAR
2009
IEEE
14 years 7 months ago
2009
IEEE
Performance evaluation of document recognition systems is a difficult and practically important problem. Issues arise in defining requirements, in characterizing the system's...
CAV
1999
Springer
15 years 1 months ago
1999
Springer
BDDs and their algorithms implement a decision procedure for Quanti ed Propositional Logic. BDDs are a kind of acyclic automata. Unrestricted automata (recognizing unbounded string...
92
Voted
SRDS
1998
IEEE
15 years 1 months ago
1998
IEEE
We study parallel algorithms for computing the minimum spanning tree of a weighted undirected graph G with n vertices and m edges. We consider an input graph G with m=n p, where p...
159
click to vote
ICDE
2006
IEEE
15 years 11 months ago
2006
IEEE
Linguistic research and natural language processing employ large repositories of ordered trees. XML, a standard ordered tree model, and XPath, its associated language, are natural...
TAGT
1994
Springer
15 years 1 months ago
1994
Springer
Graphs are a popular data structure, and graph-manipulation programs are common. Graph manipulations can be cleanly, compactly, and explicitly described using graph-rewriting notat...