Sciweavers

62 search results - page 7 / 13
» On the Expressiveness and Complexity of Randomization in Fin...
Sort
View
CLEIEJ
2007
152views more  CLEIEJ 2007»
13 years 7 months ago
Gene Expression Analysis using Markov Chains extracted from RNNs
Abstract. This paper present a new approach for the analysis of gene expression, by extracting a Markov Chain from trained Recurrent Neural Networks (RNNs). A lot of microarray dat...
Igor Lorenzato Almeida, Denise Regina Pechmann Sim...
TON
2012
11 years 9 months ago
Scalable Lookahead Regular Expression Detection System for Deep Packet Inspection
—Regular expressions (RegExes) are widely used, yet their inherent complexity often limits the total number of RegExes that can be detected using a single chip for a reasonable t...
Masanori Bando, N. Sertac Artan, H. Jonathan Chao
CORR
2010
Springer
90views Education» more  CORR 2010»
13 years 7 months ago
Logical complexity of graphs: a survey
We discuss the definability of finite graphs in first-order logic with two relation symbols for adjacency and equality of vertices. The logical depth D(G) of a graph G is equal to ...
Oleg Pikhurko, Oleg Verbitsky
ANCS
2007
ACM
13 years 11 months ago
An improved algorithm to accelerate regular expression evaluation
Modern network intrusion detection systems need to perform regular expression matching at line rate in order to detect the occurrence of critical patterns in packet payloads. Whil...
Michela Becchi, Patrick Crowley
TCOM
2008
84views more  TCOM 2008»
13 years 7 months ago
On the Performance of Closed-Loop Transmit Diversity with Noisy Channel Estimates and Finite-Depth Interleaved Convolutional Cod
Abstract-- In this paper, closed-form expressions for the uncoded bit error probability of closed-loop transmit diversity (CLTD) algorithms with two transmit and one receive antenn...
Jittra Jootar, James R. Zeidler, John G. Proakis