Sciweavers

2610 search results - page 42 / 522
» Computational Probabilistic Non-interference
Sort
View
CONTEXT
2007
Springer
14 years 3 months ago
OCCAM: Ontology-Based Computational Contextual Analysis and Modeling
The ability to model cognitive agents depends crucially on being able to encode and infer with contextual information at many levels (such as situational, psychological, social, or...
Srini Narayanan, Katie Sievers, Steven J. Maiorano
ACL
2001
13 years 10 months ago
Parse Forest Computation of Expected Governors
In a headed tree, each terminal word can be uniquely labeled with a governing word and grammatical relation. This labeling is a summary of a syntactic analysis which eliminates de...
Helmut Schmid, Mats Rooth
IPL
2006
99views more  IPL 2006»
13 years 8 months ago
Computational complexity of queries based on itemsets
We investigate determining the exact bounds of the frequencies of conjunctions based on frequent sets. Our scenario is an important special case of some general probabilistic logi...
Nikolaj Tatti
VMCAI
2010
Springer
14 years 6 months ago
Best Probabilistic Transformers
This paper investigates relative precision and optimality of analyses for concurrent probabilistic systems. Aiming at the problem at the heart of probabilistic model checking ? com...
Björn Wachter, Lijun Zhang
ICGI
1994
Springer
14 years 28 days ago
Computer Assisted Grammar Construction
: This paper proposes a new inference approach for Chinese probabilistic context-free grammar, which implements the EM algorithm based on the bracket matching schemes. By utilizing...
S. J. Young, H.-H. Shih