84 search results - page 11 / 17 » Where We Stand at Probabilistic Reasoning |
TARK
1998
Springer
13 years 12 months ago
1998
Springer
We look at the Big Match game, a variation of the repeated Matching Pennies game where if the rst player plays tails the game ends with the rst player receiving the last round...
CSL
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Two styles of definitions are usually considered to express that a security protocol preserves the confidentiality of a data s. Reachability-based secrecy means that s sh...
PODS
2008
ACM
14 years 7 months ago
2008
ACM
We present a novel definition of privacy in the framework of offline (retroactive) database query auditing. Given information about the database, a description of sensitive data, ...
SEMWEB
2007
Springer
14 years 1 months ago
2007
Springer
Classical ontologies are not suitable to represent imprecise nor uncertain pieces of information. As a solution we will combine fuzzy Description Logics with a possibilistic layer....
STACS
2010
Springer
14 years 2 months ago
2010
Springer
We call a CNF formula linear if any two clauses have at most one variable in common. We show that there exist unsatisfiable linear k-CNF formulas with at most 4k2 4k clauses, and ...