Sciweavers

311 search results - page 40 / 63
» A Bialgebraic Approach to Automata and Formal Language Theor...
Sort
View
MEMOCODE
2008
IEEE
14 years 3 months ago
Virtual prototyping AADL architectures in a polychronous model of computation
While synchrony and asynchrony are two distinct concepts of concurrency theory, effective and formally defined embedded system design methodologies usually mix the best from both...
Ma Yue, Jean-Pierre Talpin, Thierry Gautier
CSFW
1997
IEEE
14 years 25 days ago
Verifying authentication protocols with CSP
This paper presents a general approach for analysis and veri cation of authentication properties in the language of Communicating Sequential Processes (CSP). It is illustrated by ...
Steve Schneider
EACL
1989
ACL Anthology
13 years 9 months ago
A logical treatment of semi-free word order and bounded discontinuous constituency
In this paper we present a logical treatment of semifree word order and bounded discontinuous constituency. We extend standard feature value logics to treat word order in a single...
Mike Reape
DLOG
2003
13 years 10 months ago
RDFS(FA): A DL-ised Sub-language of RDFS
Description Logics (DLs), as a field of research, form a formal foundation of first-order semantic Web ontology languages, such as DAML+OIL and OWL. The Semantic Web will build ...
Jeff Z. Pan, Ian Horrocks
KDD
2009
ACM
202views Data Mining» more  KDD 2009»
14 years 9 months ago
Correlated itemset mining in ROC space: a constraint programming approach
Correlated or discriminative pattern mining is concerned with finding the highest scoring patterns w.r.t. a correlation measure (such as information gain). By reinterpreting corre...
Siegfried Nijssen, Tias Guns, Luc De Raedt