Search
Now showing items 3411-3420 of 4210
Ignorable Information in Multi-Agent Scenarios
(2008-05-12)
In some multi-agent scenarios, identifying observations that an agent can safely ignore reduces exponentially the size of the agent's strategy space and hence the time required to find a Nash equilibrium. We consider games ...
On a model of visual cortex: learning invariance and selectivity
(2008-04-04)
In this paper we present a class of algorithms for similarity learning on spaces of images. The general framework that we introduce is motivated by some well-known hierarchical pre-processing architectures for object ...
Gesture in Automatic Discourse Processing
(2008-05-07)
Computers cannot fully understand spoken language without access to the wide range of modalities that accompany speech. This thesis addresses the particularly expressive modality of hand gesture, and focuses on building ...
Non-Metrical Navigation Through Visual Path Control
(2008-06-06)
We describe a new method for wide-area, non-metrical robot navigationwhich enables useful, purposeful motion indoors. Our method has twophases: a training phase, in which a human user directs a wheeledrobot with an attached ...
Perfect Implementation of Normal-Form Mechanisms
(2007-03)
Privacy and trust affect our strategic thinking, yet they have not been precisely modeled in mechanism design. In settings of incomplete information, traditional implementations of a normal-form mechanism ---by disregarding ...
Fast concurrent object classification and localization
(2008-06-10)
Object localization and classification are important problems incomputer vision. However, in many applications, exhaustive searchover all class labels and image locations is computationallyprohibitive. While several methods ...
List Processing in Real Time on a Serial Computer
(MIT Artificial Intelligence Laboratory, 1977-04-01)
A real-time list processing system is one in which the time required by each elementary list operation (CONS, CAR, CDR, RPLACA, RPLACD, EQ, and ATOM in LISP) is bounded by a (small) constant. Classical list processing ...
Shallow Binding in LISP 1.5
(MIT Artificial Intelligence Laboratory, 1977-01)
Shallow binding is a scheme which allows the value of a variable to be accessed in a bounded amount of computation. An elegant model for shallow binding in LISP 1.5 is presented in which context-switching is an environment ...
Laws for Communicating Parallel Processes
(MIT Artificial Intelligence Laboratory, 1977-05-10)
This paper presents some laws that must be satisfied by computations involving communicating parallel processes. The laws are stated in the context of the actor theory, a model for distributed parallel computation, and ...
Cryptology and Data Communications
(MIT Artificial Intelligence Laboratory, 1976-12)
This paper is divided into two parts. The first part deals with cryptosystems and cryptanalysis. It surveys the basic information about cryptosystems and then addresses two specific questions. Are cryptosystems such as ...