Open Access Repositories: Recent submissions

Now showing items 2041-2060 of 4204

  • Ignorable Information in Multi-Agent Scenarios 

    Unknown author (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 ...

  • Perfect Implementation of Normal-Form Mechanisms 

    Unknown author (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 ...

  • Gesture in Automatic Discourse Processing 

    Unknown author (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 ...

  • Efficient Object Recognition and Image Retrieval for Large-Scale Applications 

    Unknown author (2008-05-06)
    Algorithms for recognition and retrieval tasks generally call for both speed and accuracy. When scaling up to very large applications, however, we encounter additional significant requirements: adaptability and scalability. ...

  • New-Age Cryptography 

    Unknown author (2008-04-16)
    We introduce new and general complexity theoretic hardness assumptions. These assumptions abstract out concrete properties of a random oracle and are significantly stronger than traditional cryptographic hardness assumptions; ...

  • Transferring Nonlinear Representations using Gaussian Processes with a Shared Latent Space 

    Unknown author (2008-04-11)
    When a series of problems are related, representations derived from learning earlier tasks may be useful in solving later problems. In this paper we propose a novel approach to transfer learning with low-dimensional, ...

  • Random-World Semantics and Syntactic Independence for Expressive Languages 

    Unknown author (2008-05-03)
    We consider three desiderata for a language combining logic and probability: logical expressivity, random-world semantics, and the existence of a useful syntactic condition for probabilistic independence. Achieving these ...

  • Generalization of the MV Mechanism 

    Unknown author (2008-05-01)
    Micali and Valiant proposed a mechanism for combinatorial auctions that is dominant-strategy truthful, guarantees reasonably high revenue, and is very resilient against collusions. Their mechanism, however, uses as a ...

  • Block Heavy Hitters 

    Unknown author (2008-05-02)
    e study a natural generalization of the heavy hitters problem in thestreaming context. We term this generalization *block heavy hitters* and define it as follows. We are to stream over a matrix$A$, and report all *rows* ...

  • Understanding camera trade-offs through a Bayesian analysis of light field projections 

    Unknown author (2008-04-16)
    Computer vision has traditionally focused on extracting structure,such as depth, from images acquired using thin-lens or pinhole optics. The development of computational imaging is broadening this scope; a variety of ...

  • Shadows and Cracks 

    Unknown author (MIT Artificial Intelligence Laboratory, 1971-06)
    The VIRGIN program will interpret pictures of crack and shadow free scenes by labelling them according to the Clowes/Huffman formalism. This paper indicates methods of extending the program to include cracks and shadows ...

  • Injection Molding at the MIT Artificial Intelligence Lab 

    Unknown author (MIT Artificial Intelligence Laboratory, 1995-02-23)
    This paper describes the injection molding equipment at the MIT Artificial Intelligence Lab and how to use it. Topic covered include mold design, insert molding, safety, and material properties.

  • Capture It, Name It, Own it: How to capture re-occurring patterns, name them and turn them into reusable functions via Emacs kbd-macros 

    Unknown author (MIT Artificial Intelligence Laboratory, 1992-05)
    The purpose of this talk is not to teach you about Emacs or Emacs kbd-macros, though we will use both as examples. I can teach you everything there is to know about Emacs and kbd-macros in 5 minutes. There are literally ...

  • Tomorrow's Surgery: Micromotors and Microrobots 

    Unknown author (MIT Artificial Intelligence Laboratory, 1992-07)
    Surgical procedures have changed radically over the last few years due to the arrival of new technology. What will technology bring us in the future? This paper examines a few of the forces whose timing are causing new ...

  • AI Lab Faculty 

    Unknown author (MIT Artificial Intelligence Laboratory, 1992-09)
    This document is meant to introduce new graduate students in the MIT AI Lab to the faculty members of the laboratory and their research interests. Each entry consists of the faculty member's picture, if available, some ...

  • A User's Guide to the AI Lab: Getting Started at Tech Square 

    Unknown author (MIT Artificial Intelligence Laboratory, 1991-08-18)

  • Fine Grained Robotics 

    Unknown author (MIT Artificial Intelligence Laboratory, 1991-02)
    Fine grained robotics is the idea of solving problems utilizing multitudes of very simple machines in place of one large complex entity. Organized in the proper way, simple machines and simple behaviors can lead to emergent ...

  • The Evolution of Society 

    Unknown author (MIT Artificial Intelligence Laboratory, 1991-08-05)
    We re-examine the evolutionary stability of the tit-for-tat (tft) strategy in the context of the iterated prisoner's dilemma, as introduced by Axelrod and Hamilton. This environment involves a mixture of populations of ...

  • Correction of Force Errors for Flexible Manipulators in Quasi-Static Conditions 

    Unknown author (MIT Artificial Intelligence Laboratory, 1990-12)
    This paper deals with the problem of controlling the interactions of flexible manipulators with their environment. For executing a force control task, a manipulator with intrinsic (mechanical) compliance has some advantages ...

  • An Experiment in Knowledge Acquisition for Software Requirements 

    Unknown author (MIT Artificial Intelligence Laboratory, 1990-05)
    The Requirements Apprentice (RA) is a demonstration system that assists a human analyst in the requirements-acquisition phase of the software-development process. By applying the RA to another example it has been possible ...