Sciweavers

3937 search results - page 255 / 788
» Questioning Ubiquitous Computing
Sort
View
EUROCRYPT
2007
Springer
15 years 10 months ago
Universally Composable Multi-party Computation Using Tamper-Proof Hardware
Protocols proven secure within the universal composability (UC) framework satisfy strong and desirable security properties. Unfortunately, it is known that within the “plain” m...
Jonathan Katz
BIRTHDAY
2010
Springer
15 years 9 months ago
The Arrow of Time through the Lens of Computing
Egon Börger Ambient Abstract State Machines with Applications 11:00 AM Manfred Broy Realizability of System Interface Specifications 11:30 AM Ofer Strichman Proving Equivalence be...
Krishna V. Palem
CCS
2006
ACM
15 years 8 months ago
Secure information sharing enabled by Trusted Computing and PEI models
The central goal of secure information sharing is to "share but protect" where the motivation to "protect" is to safeguard the sensitive content from unauthori...
Ravi S. Sandhu, Kumar Ranganathan, Xinwen Zhang
EACL
1993
ACL Anthology
15 years 5 months ago
A Computational Treatment of Sentence-Final 'then'
We describe a computational system which parses discourses consisting of sequences of simple sentences. These contain a range of temporal constructions, including time adverbials,...
Sheila Glasbey
AI
2007
Springer
15 years 4 months ago
Computational properties of argument systems satisfying graph-theoretic constraints
One difficulty that arises in abstract argument systems is that many natural questions regarding argument acceptability are, in general, computationally intractable having been c...
Paul E. Dunne