Sciweavers

9405 search results - page 1174 / 1881
» Computing a Model of Set Theory
Sort
View
SIGMOD
2007
ACM
156views Database» more  SIGMOD 2007»
16 years 7 months ago
M-invariance: towards privacy preserving re-publication of dynamic datasets
The previous literature of privacy preserving data publication has focused on performing "one-time" releases. Specifically, none of the existing solutions supports re-pu...
Xiaokui Xiao, Yufei Tao
IDTRUST
2009
ACM
16 years 2 months ago
A calculus of trust and its application to PKI and identity management
We introduce a formal semantics based calculus of trust that explicitly represents trust and quantifies the risk associated with trust in public key infrastructure (PKI) and iden...
Jingwei Huang, David Nicol
LATA
2009
Springer
16 years 2 months ago
Rigid Tree Automata
We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a rest...
Florent Jacquemard, Francis Klay, Camille Vacher
LICS
2009
IEEE
16 years 2 months ago
An Improved Lower Bound for the Complementation of Rabin Automata
Automata on infinite words (ω-automata) have wide applications in formal language theory as well as in modeling and verifying reactive systems. Complementation of ωautomata is ...
Yang Cai, Ting Zhang, Haifeng Luo
ECSQARU
2009
Springer
16 years 2 months ago
Extracting the Core of a Persuasion Dialog to Evaluate Its Quality
: A persuasion dialog is a dialog in which agents exchange arguments on a subject. In this kind of dialog, the agents disagree about the status of the subject and each one tries to...
Leila Amgoud, Florence Dupin de Saint-Cyr
« Prev « First page 1174 / 1881 Last » Next »