Sciweavers

1461 search results - page 43 / 293
» On Regular Reduced Products
Sort
View
INFOCOM
2011
IEEE
13 years 16 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
DAC
2005
ACM
13 years 10 months ago
Design methodology for IC manufacturability based on regular logic-bricks
Implementing logic blocks in an integrated circuit in terms of repeating or regular geometry patterns [6,7] can provide significant advantages in terms of manufacturability and de...
V. Kheterpal, V. Rovner, T. G. Hersan, D. Motiani,...
ICC
2011
IEEE
237views Communications» more  ICC 2011»
12 years 8 months ago
Reorganized and Compact DFA for Efficient Regular Expression Matching
—Regular expression matching has become a critical yet challenging technique in content-aware network processing, such as application identification and deep inspection. To meet ...
Kai Wang, Yaxuan Qi, Yibo Xue, Jun Li
BMCBI
2010
109views more  BMCBI 2010»
13 years 9 months ago
Prediction of the binding affinities of peptides to class II MHC using a regularized thermodynamic model
Background: The binding of peptide fragments of extracellular peptides to class II MHC is a crucial event in the adaptive immune response. Each MHC allotype generally binds a dist...
Andrew J. Bordner, Hans D. Mittelmann
TMI
2010
143views more  TMI 2010»
13 years 3 months ago
Data Specific Spatially Varying Regularization for Multimodal Fluorescence Molecular Tomography
Fluorescence molecular tomography (FMT) allows in vivo localization and quantification of fluorescence biodistributions in whole animals. The ill-posed nature of the tomographic re...
Damon Hyde, Eric L. Miller, Dana H. Brooks, Vasili...