Sciweavers

1449 search results - page 63 / 290
» Finiteness results for sigmoidal
Sort
View
CONEXT
2007
ACM
15 years 10 months ago
A hybrid finite automaton for practical deep packet inspection
Deterministic finite automata (DFAs) are widely used to perform regular expression matching in linear time. Several techniques have been proposed to compress DFAs in order to redu...
Michela Becchi, Patrick Crowley
ADCM
2008
112views more  ADCM 2008»
15 years 6 months ago
Frames in spaces with finite rate of innovation
Abstract. Signals with finite rate of innovation are those signals having finite degrees of freedom per unit of time that specify them. In this paper, we introduce a prototypical s...
Qiyu Sun
MEMOCODE
2010
IEEE
15 years 4 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
ICIP
2006
IEEE
16 years 8 months ago
Exact Local Reconstruction Algorithms for Signals with Finite Rate of Innovation
Consider the problem of sampling signals which are not bandlimited, but still have a finite number of degrees of freedom per unit of time, such as, for example, piecewise polynomi...
Pier Luigi Dragotti, Martin Vetterli, Thierry Blu
ITC
1999
IEEE
105views Hardware» more  ITC 1999»
15 years 10 months ago
Finite state machine synthesis with concurrent error detection
A new synthesis technique for designing finite state machines with on-line parity checking is presented. The output logic and the next-state logic of the finite state machines are...
Chaohuang Zeng, Nirmal R. Saxena, Edward J. McClus...