Sciweavers

12289 search results - page 327 / 2458
» computing 2006
Sort
View
FOSSACS
2006
Springer
15 years 8 months ago
Guessing Attacks and the Computational Soundness of Static Equivalence
The indistinguishability of two pieces of data (or two lists of pieces of data) can be represented formally in terms of a relation called static equivalence. Static equivalence dep...
Martín Abadi, Mathieu Baudet, Bogdan Warins...
FSTTCS
2006
Springer
15 years 8 months ago
Computationally Sound Symbolic Secrecy in the Presence of Hash Functions
The standard symbolic, deducibility-based notions of secrecy are in general insufficient from a cryptographic point of view, especially in presence of hash functions. In this paper...
Véronique Cortier, Steve Kremer, Ralf K&uum...
AAAI
2007
15 years 7 months ago
Computing Optimal Subsets
Various tasks in decision making and decision support require selecting a preferred subset of items from a given set of feasible items. Recent work in this area considered methods...
Maxim Binshtok, Ronen I. Brafman, Solomon Eyal Shi...
AAAI
2006
15 years 6 months ago
Introductory Computer Science with Robots
Starting in the fall of 2005 our department began a large-scale effort to incorporate hands-on robotics in many of our courses, including our introductory computer science sequenc...
Debra T. Burhans, R. Mark Meyer, Patricia VanVerth...
151
Voted
COMMA
2006
15 years 6 months ago
Computing Preferred Extensions for Argumentation Systems with Sets of Attacking Arguments
The hitherto most abstract, and hence general, argumentation system, is the one described by Dung in a paper from 1995. This framework does not allow for joint attacks on arguments...
Søren Holbech Nielsen, Simon Parsons