Sciweavers

1998 search results - page 182 / 400
» Basic Association Rules
Sort
View
ASIAN
2006
Springer
116views Algorithms» more  ASIAN 2006»
15 years 7 months ago
Secrecy Analysis in Protocol Composition Logic
We present formal proof rules for inductive reasoning about the way that data transmitted on the network remains secret from a malicious attacker. Extending a compositional protoco...
Arnab Roy, Anupam Datta, Ante Derek, John C. Mitch...
AAAI
2010
15 years 5 months ago
A General Game Description Language for Incomplete Information Games
A General Game Player is a system that can play previously unknown games given nothing but their rules. The Game Description Language (GDL) has been developed as a highlevel knowl...
Michael Thielscher
ENTCS
2007
93views more  ENTCS 2007»
15 years 4 months ago
Modeling Pointer Redirection as Cyclic Term-graph Rewriting
We tackle the problem of data-structure rewriting including global and local pointer redirections. Each basic rewrite step may perform three kinds of actions: (i) Local redirectio...
Dominique Duval, Rachid Echahed, Fréd&eacut...
CCS
2007
ACM
15 years 10 months ago
Provably secure ciphertext policy ABE
In ciphertext policy attribute-based encryption (CP-ABE), every secret key is associated with a set of attributes, and every ciphertext is associated with an access structure on a...
Ling Cheung, Calvin C. Newport
UIST
2010
ACM
15 years 1 months ago
UIMarks: quick graphical interaction with specific targets
This paper reports on the design and evaluation of UIMarks, a system that lets users specify on-screen targets and associated actions by means of a graphical marking language. UIM...
Olivier Chapuis, Nicolas Roussel