Sciweavers

993 search results - page 33 / 199
» Set Constraints on Regular Terms
Sort
View
SIGCOMM
2006
ACM
14 years 2 months ago
Algorithms to accelerate multiple regular expressions matching for deep packet inspection
There is a growing demand for network devices capable of examining the content of data packets in order to improve network security and provide application-specific services. Most...
Sailesh Kumar, Sarang Dharmapurikar, Fang Yu, Patr...
BMCBI
2006
152views more  BMCBI 2006»
13 years 9 months ago
Amplification of the Gene Ontology annotation of Affymetrix probe sets
Background: The annotations of Affymetrix DNA microarray probe sets with Gene Ontology terms are carefully selected for correctness. This results in very accurate but incomplete a...
Enrique M. Muro, Carolina Perez-Iratxeta, Miguel A...
BMCBI
2008
175views more  BMCBI 2008»
13 years 9 months ago
Synonym set extraction from the biomedical literature by lexical pattern discovery
Background: Although there are a large number of thesauri for the biomedical domain many of them lack coverage in terms and their variant forms. Automatic thesaurus construction b...
John McCrae, Nigel Collier
INFOCOM
2011
IEEE
13 years 17 days ago
Space-time tradeoff in regular expression matching with semi-deterministic finite automata
Abstract—Regular expression matching (REM) with nondeterministic finite automata (NFA) can be computationally expensive when a large number of patterns are matched concurrently....
Yi-Hua E. Yang, Viktor K. Prasanna
POPL
2004
ACM
14 years 9 months ago
Incremental execution of transformation specifications
We aim to specify program transformations in a declarative style, and then to generate executable program transformers from such specifications. Many transformations require non-t...
Ganesh Sittampalam, Oege de Moor, Ken Friis Larsen