Search
Now showing items 11-20 of 79
Bounded CCA2-Secure Non-Malleable Encryption
(2006-12-14)
Under an adaptive chosen ciphertext attack (CCA2), the security of an encryption scheme must hold against adversaries that have access to a decryption oracle. We consider a weakening of CCA2 security, wherein security ...
Distributed Area Search with a Team of Robots
(2006-12-05)
The main goal of this thesis is to demonstrate the applicability of the distributed systems paradigm to robotic systems. This goal is accomplished by presenting two solutions to the Distributed Area Search problem: organizing ...
Pyramid Match Kernels: Discriminative Classification with Sets of Image Features (version 2)
(2006-03-18)
Discriminative learning is challenging when examples are sets of features, and the sets vary in cardinality and lack any sort of meaningful ordering. Kernel-based classification methods can learn complex decision boundaries, ...
Task-Structured Probabilistic I/O Automata
(2006-03-31)
In the Probabilistic I/O Automata (PIOA) framework, nondeterministicchoices are resolved using perfect-information schedulers,which are similar to history-dependent policies for Markov decision processes(MDPs). These ...
Maximum Entropy Correlated Equilibria
(2006-03-20)
We study maximum entropy correlated equilibria in (multi-player)games and provide two gradient-based algorithms that are guaranteedto converge to such equilibria. Although we do not provideconvergence rates for these ...
Using Task-Structured Probabilistic I/O Automata to Analyze an Oblivious Transfer Protocol
(2006-03-08)
AbstractThe Probabilistic I/O Automata framework of Lynch, Segala and Vaandrager provides tools for precisely specifying protocols and reasoning about their correctness using multiple levels of abstraction, based on ...
Computing action equivalences for planning under time-constraints
(2006-03-20)
In order for autonomous artificial decision-makers to solverealistic tasks, they need to deal with the dual problems of searching throughlarge state and action spaces under time pressure.We study the problem of planning ...
Hyperglue: Designing High-Level Agent Communication for Distributed Applications
(2006-03-01)
We are building a new communication model and discoverysystem which will allow agent-based intelligent spacesto interact with one another. This new infrastructure layer,called Hyperglue, coordinates agent actions at a ...
DNA Binding and Games
(2006-03-06)
We propose a game-theoretic approach tolearn and predict coordinate binding of multiple DNA bindingregulators. The framework implements resource constrainedallocation of proteins to local neighborhoods as well as to ...
Plan-Driven Pervasive Computing
(2006-03-01)
The goal of human-centered, pervasive computing should be to hide the details of the computing environment, allowing users to concentrate on their goals, rather than on the direct management of devices. This paper describes ...