Search
Now showing items 261-270 of 648
MORE: A Network Coding Approach to Opportunistic Routing
(2006-06-30)
Opportunistic routing has the potential to substantially increase wireless network throughput. Prior work on opportunistic routing, however, requires tight node coordination. Different nodes in a network must have knowledge ...
Using Probabilistic I/O Automata to Analyze an Oblivious Transfer Protocol
(2006-06-19)
We demonstrate how to carry out cryptographic security analysis ofdistributed protocols within the Probabilistic I/O Automataframework of Lynch, Segala, and Vaandrager. This framework providestools for arguing rigorously ...
Iterative Collaborative Ranking of Customers and Providers
(2006-07-04)
This paper introduces a new application: predicting the Internet provider-customer market. We cast the problem in the collaborative filtering framework, where we use current and past customer-provider relationships to ...
Using Task-Structured Probabilistic I/O Automata to Analyze an Oblivious Transfer Protocol
(2006-06-20)
The Probabilistic I/O Automata framework of Lynch, Segala and Vaandrager provides tools for precisely specifying protocols and reasoning about theircorrectness using multiple levels of abstraction, based on implementation ...
Approximate Correspondences in High Dimensions
(2006-06-15)
Pyramid intersection is an efficient method for computing an approximate partial matching between two sets of feature vectors. We introduce a novel pyramid embedding based on a hierarchy of non-uniformly shaped bins that ...
A Few Days of A Robot's Life in the Human's World: Toward Incremental Individual Recognition
(2007-04-03)
This thesis presents an integrated framework and implementation for Mertz, an expressive robotic creature for exploring the task of face recognition through natural interaction in an incremental and unsupervised fashion. ...
Distributed Method Selection and Dispatching of Contingent, Temporally Flexible Plans
(2007-03-05)
Many applications of autonomous agents require groups to work in tight coordination. To be dependable, these groups must plan, carry out and adapt their activities in a way that is robust to failure and to uncertainty. ...
Phonetic Classification Using Hierarchical, Feed-forward, Spectro-temporal Patch-based Architectures
(2007-03-21)
A preliminary set of experiments are described in which a biologically-inspired computer vision system (Serre, Wolf et al. 2005; Serre 2006; Serre, Oliva et al. 2006; Serre, Wolf et al. 2006) designed for visual object ...
A Theory of Object Recognition: Computations and Circuits in the Feedforward Path of the Ventral Stream in Primate Visual Cortex
(2005-12-19)
We describe a quantitative theory to account for the computations performed by the feedforward path of the ventral stream of visual cortex and the local circuits implementing them. We show that a model instantiating the ...
Discriminative Gaussian Process Latent Variable Model for Classification
(2007-03-28)
Supervised learning is difficult with high dimensional input spacesand very small training sets, but accurate classification may bepossible if the data lie on a low-dimensional manifold. GaussianProcess Latent Variable ...