Sciweavers

1414 search results - page 70 / 283
» Combining Intruder Theories
Sort
View
UAI
2007
13 years 11 months ago
A System for Ontologically-Grounded Probabilistic Matching
This paper is part of a project to match descriptions of real-world instances and probabilistic models, both of which can be described at mulvel of abstraction and detail. We use ...
Rita Sharma, David Poole, Clinton Smyth
APAL
2008
96views more  APAL 2008»
13 years 10 months ago
On superstable CSA-groups
We show that an existentially closed CSA -group is not superstable. We prove that a non-abelian superstable CSA-group has an infinite definable simple subgroup all of whose proper...
Abderezak Ould Houcine
AAECC
2006
Springer
109views Algorithms» more  AAECC 2006»
13 years 10 months ago
Cryptosystems using Linear Groups
Several suggestions are presented for developing cryptosystems, both classical and public key, using a combination of combinatorial group theory and linear groups. In particular, t...
Gilbert Baumslag, Benjamin Fine, Xiaowei Xu
IDA
2007
Springer
13 years 10 months ago
Second-order uncertainty calculations by using the imprecise Dirichlet model
Natural extension is a powerful tool for combining the expert judgments in the framework of imprecise probability theory. However, it assumes that every judgment is “true” and...
Lev V. Utkin
ECRTS
2004
IEEE
14 years 1 months ago
Improved Prediction for Web Server Delay Control
Control methods are being used increasingly for uncertainty management and QoS in modern web server systems. Previous approaches have suggested combined feedforward and feedback c...
Dan Henriksson, Ying Lu 0002, Tarek F. Abdelzaher