Sciweavers

81 search results - page 6 / 17
» An adaptable FPGA-based System for Regular Expression Matchi...
Sort
View
TREC
2004
13 years 8 months ago
Bangor at TREC 2004: Question Answering Track
This paper describes the participation of the School of Informatics, University of Wales, Bangor in the 2004 Text Retrieval Conference. We present additions and modications to the...
Terence Clifton, William John Teahan
ENTCS
2008
74views more  ENTCS 2008»
13 years 7 months ago
Matching Systems for Concurrent Calculi
Matching systems were introduced by Carbone and Maffeis, and used to investigate the expressiveness of the pi-calculus with polyadic synchronisation. We adapt their definition and...
Bjørn Haagensen, Sergio Maffeis, Iain Phill...
ATVA
2008
Springer
131views Hardware» more  ATVA 2008»
13 years 9 months ago
Computation Tree Regular Logic for Genetic Regulatory Networks
Model checking has proven to be a useful analysis technique not only for concurrent systems, but also for the genetic regulatory networks (Grns) that govern the functioning of livi...
Radu Mateescu, Pedro T. Monteiro, Estelle Dumas, H...
RAID
2010
Springer
13 years 5 months ago
Improving NFA-Based Signature Matching Using Ordered Binary Decision Diagrams
Network intrusion detection systems (NIDS) make extensive use of regular expressions as attack signatures. Internally, NIDS represent and operate these signatures using finite au...
Liu Yang, Rezwana Karim, Vinod Ganapathy, Randy Sm...
PLDI
2004
ACM
14 years 28 days ago
Parametric regular path queries
Regular path queries are a way of declaratively expressing queries on graphs as regular-expression-like patterns that are matched against paths in the graph. There are two kinds o...
Yanhong A. Liu, Tom Rothamel, Fuxiang Yu, Scott D....