Sciweavers

206 search results - page 29 / 42
» Deterministic Caterpillar Expressions
Sort
View
RAID
2010
Springer
13 years 8 months ago
Improving NFA-Based Signature Matching Using Ordered Binary Decision Diagrams
Network intrusion detection systems (NIDS) make extensive use of regular expressions as attack signatures. Internally, NIDS represent and operate these signatures using finite au...
Liu Yang, Rezwana Karim, Vinod Ganapathy, Randy Sm...
TIT
2011
113views more  TIT 2011»
13 years 4 months ago
Asymptotic Capacity and Optimal Precoding in MIMO Multi-Hop Relay Networks
A multi-hop relaying system is analyzed where data sent by a multi-antenna source is relayed by successive multi-antenna relays until it reaches a multi-antenna destination. Assum...
Nadia Fawaz, Keyvan Zarifi, Mérouane Debbah...
LMCS
2007
132views more  LMCS 2007»
13 years 9 months ago
The Complexity of Model Checking Higher-Order Fixpoint Logic
Higher-Order Fixpoint Logic (HFL) is a hybrid of the simply typed λ-calculus and the modal µ-calculus. This makes it a highly expressive temporal logic that is capable of express...
Roland Axelsson, Martin Lange, Rafal Somla
ISMIS
2009
Springer
14 years 4 months ago
Fuzzy Clustering for Categorical Spaces
Abstract. A multi-relational clustering method is presented which can be applied to complex knowledge bases storing resources expressed in the standard Semantic Web languages. It a...
Nicola Fanizzi, Claudia d'Amato, Floriana Esposito
PODC
2012
ACM
12 years 8 days ago
Weak models of distributed computing, with connections to modal logic
This work presents a classification of weak models of distributed computing. We focus on deterministic distributed algorithms, and we study models of computing that are weaker ve...
Lauri Hella, Matti Järvisalo, Antti Kuusisto,...