81 search results - page 6 / 17 » A Formalisation of Finite Automata Using Hereditarily Finite... |
119
Voted
DKE
2006
14 years 9 months ago
2006
Information extraction (IE) addresses the problem of extracting specific information from a collection of documents. Much of the previous work on IE from structured documents, suc...
ANCS
2009
ACM
14 years 7 months ago
2009
ACM
Pattern matching is the most computation intensive task of a network intrusion detection system (NIDS). In this paper we present a hardware architecture to speed up the pattern mat...
CONCUR
2006
Springer
14 years 11 months ago
2006
Springer
In regular inference, the problem is to infer a regular language, typically represented by a deterministic finite automaton (DFA) from answers to a finite set of membership querie...
CICLING
2003
Springer
15 years 2 months ago
2003
Springer
Finite-state processing is typically based on structures that allow for efficient indexing and sequential search. However, this “rigid” framework has several disadvantages when...
CSL
2008
Springer
14 years 11 months ago
2008
Springer
Quantitative generalizations of classical languages, which assign to each word a real number instead of a boolean value, have applications in modeling resource-constrained computat...