Sciweavers

1707 search results - page 42 / 342
» A Computational Model for Arguments Understanding
Sort
View
CSFW
2006
IEEE
15 years 3 months ago
Computationally Sound Compositional Logic for Key Exchange Protocols
We develop a compositional method for proving cryptographically sound security properties of key exchange protocols, based on a symbolic logic that is interpreted over conventiona...
Anupam Datta, Ante Derek, John C. Mitchell, Bogdan...
STOC
2000
ACM
134views Algorithms» more  STOC 2000»
15 years 2 months ago
Computing the median with uncertainty
We consider a new model for computing with uncertainty. It is desired to compute a function fX1; : : : ; Xn where X1; : : : ; Xn are unknown, but guaranteed to lie in speci ed i...
Tomás Feder, Rajeev Motwani, Rina Panigrahy...
TCC
2012
Springer
245views Cryptology» more  TCC 2012»
13 years 5 months ago
Secure Two-Party Computation with Low Communication
We propose a 2-party UC-secure protocol that can compute any function securely. The protocol requires only two messages, communication that is poly-logarithmic in the size of the ...
Ivan Damgård, Sebastian Faust, Carmit Hazay
HRI
2010
ACM
15 years 4 months ago
Robust spoken instruction understanding for HRI
—Natural human-robot interaction requires different and more robust models of language understanding (NLU) than non-embodied NLU systems. In particular, architectures are require...
Rehj Cantrell, Matthias Scheutz, Paul W. Schermerh...
ATAL
2006
Springer
15 years 1 months ago
Toward an understanding of the impact of software personal assistants on human organizations
Intelligent software personal assistants for human organizations are an active research area within the multiagent community. However, while many capabilities for these software p...
Steven Okamoto, Paul Scerri, Katia P. Sycara