Sciweavers

279 search results - page 17 / 56
» A Name Abstraction Functor for Named Sets
Sort
View
ACNS
2011
Springer
244views Cryptology» more  ACNS 2011»
13 years 11 days ago
Quantitatively Analyzing Stealthy Communication Channels
Abstract. Attackers in particular botnet controllers use stealthy messaging systems to set up large-scale command and control. Understanding the capacity of such communication chan...
Patrick Butler, Kui Xu, Danfeng (Daphne) Yao
CINQ
2004
Springer
131views Database» more  CINQ 2004»
14 years 2 months ago
Model-Independent Bounding of the Supports of Boolean Formulae in Binary Data
Abstract. Data mining algorithms such as the Apriori method for finding frequent sets in sparse binary data can be used for efficient computation of a large number of summaries fr...
Artur Bykowski, Jouni K. Seppänen, Jaakko Hol...
LPNMR
2005
Springer
14 years 2 months ago
Nested Epistemic Logic Programs
Abstract. Nested logic programs and epistemic logic programs are two important extensions of answer set programming. However, the relationship between these two formalisms is rarel...
Kewen Wang, Yan Zhang
OTM
2005
Springer
14 years 2 months ago
Creating Ontologies for Content Representation-The OntoSeed Suite
Abstract. Due to the inherent difficulties associated with manual ontology building, knowledge acquisition and reuse are often seen as methods that can make this tedious process ea...
Elena Paslaru Bontas, David Schlangen, Thomas Schr...
CONCUR
2006
Springer
14 years 14 days ago
A Livelock Freedom Analysis for Infinite State Asynchronous Reactive Systems
We describe an incomplete but sound and efficient livelock freedom test for infinite state asynchronous reactive systems. The method s a system into a set of simple control flow cy...
Stefan Leue, Alin Stefanescu, Wei Wei