216 search results - page 7 / 44 » From Constraints to Finite Automata to Filtering Algorithms |
ACL
1998
13 years 8 months ago
1998
In wide-coverage lexicalized grammars many of the elementary structures have substructures in common. This means that in conventional parsing algorithms some of the computation as...
ICC
2007
IEEE
14 years 1 months ago
2007
IEEE
—Network Intrusion Detection Systems (NIDS) are more and more important in today’s network security for identifying and preventing malicious attacks over the network. This pape...
ATVA
2006
Springer
13 years 11 months ago
2006
Springer
Whereas partial order methods have proved their efficiency for the analysis of discrete-event systems, their application to timed systems remains a challenging research topic. Here...
AICOM
2004
13 years 7 months ago
2004
Abstract. Dechter et al. [5] proposed solving the Temporal Constraint Satisfaction Problem (TCSP) by modeling it as a metaCSP, which is a finite CSP with a unique global constraint...
IWRIDL
2006
ACM
14 years 1 months ago
2006
ACM
We present the state of the art of a computational platform for the analysis of classical Sanskrit. The platform comprises modules for phonology, morphology, segmentation and shal...