Sciweavers

197 search results - page 13 / 40
» Circuits, Pebbling and Expressibility
Sort
View
RECONFIG
2008
IEEE
224views VLSI» more  RECONFIG 2008»
14 years 1 months ago
Automatic Construction of Large-Scale Regular Expression Matching Engines on FPGA
—We present algorithms for implementing large-scale regular expression matching (REM) on FPGA. Based on the proposed algorithms, we develop tools that first transform regular ex...
Yi-Hua E. Yang, Viktor K. Prasanna
MEMOCODE
2010
IEEE
13 years 5 months ago
A regular expression matching using non-deterministic finite automaton
Abstract--This paper shows an implementation of CANSCID (Combined Architecture for Stream Categorization and Intrusion Detection). To satisfy the required system throughput, the pa...
Hiroshi Nakahara, Tsutomu Sasao, Munehiro Matsuura
IPPS
2008
IEEE
14 years 1 months ago
Symbolic expression analysis for compiled communication
Enabling circuit switching in multiprocessor systems has the potential to achieve more efficient communication with lower cost compared to packet/wormhole switching. However, in ...
Shuyi Shao, Yu Zhang, Alex K. Jones, Rami G. Melhe...
GECCO
2007
Springer
131views Optimization» more  GECCO 2007»
14 years 1 months ago
Using feedback to regulate gene expression in a developmental control architecture
We present what we believe is the first attempt to physically reconstruct the exploratory mechanism of genetic regulatory networks. Feedback plays a crucial role during developme...
Kester Clegg, Susan Stepney, Tim Clarke
INTEGRATION
2008
89views more  INTEGRATION 2008»
13 years 7 months ago
Exact ESCT minimization for functions of up to six input variables
In this paper an efficient algorithm for the synthesis and exact minimization of ESCT(Exclusive or Sum of Complex Terms) expressions for Boolean functions of at most six variables...
Dimitrios Voudouris, Marinos Sampson, George K. Pa...