Browsing Computer Science and Artificial Intelligence Lab (CSAIL) by Title

Now showing items 81-100 of 2625

  • Alloy*: A Higher-Order Relational Constraint Solver 

    Unknown author (2014-09-02)
    The last decade has seen a dramatic growth in the use of constraint solvers as a computational mechanism, not only for analysis and synthesis of software, but also at runtime. Solvers are available for a variety of logics ...

  • Alpenhorn: Bootstrapping Secure Communication without Leaking Metadata 

    Unknown author (2016-10-05)
    Alpenhorn is the first system for initiating an encrypted connection between two users that provides strong privacy and forward secrecy guarantees for metadata (i.e., information about which users connected to each other) ...

  • The Alpha-Beta Heuristic 

    Unknown author (1961-12-01)
    The Alpha-Beta heuristic is a method for pruning unneeded branches from the move tree of a game. The algorithm makes use of information gained about part of the tree to reject those branches which will not affect the ...

  • An Alternative to Using the 3D Delaunay Tessellation for Representing Freespace 

    Unknown author (1989-09-01)
    Representing the world in terms of visible surfaces and the freespacesexisting between these surfaces and the viewer is an important problemsin robotics. Recently, researchers have proposed using the 3DsDelaunay ...

  • AMAR: A Computational Model of Autosegmental Phonology 

    Unknown author (1993-10-01)
    This report describes a computational system with which phonologists may describe a natural language in terms of autosegmental phonology, currently the most advanced theory pertaining to the sound systems of human ...

  • Ambiguities of a Motion Field 

    Unknown author (1987-01-01)
    We study the conditions under which a perspective motion field can have multiple interpretations. Furthermore, we show that in most cases, the ambiguity in the interpretation of a motion field can be resolved by imposing ...

  • AMORD: A Deductive Procedure System 

    Unknown author (1978-01-01)
    We have implemented an interpreter for a rule-based system, AMORD, based on a non-chronological control structure and a system of automatically maintained data-dependencies. The purpose of this paper is to serve as a ...

  • AMORD: A Deductive Procedure System 

    Unknown author (MIT Artificial Intelligence Laboratory, 1977-08)
    We have implemented an interpreter for a rule-based system, AMORD, based on a non-chronological control structure and a system of automatically maintained data-dependencies. The purpose of this paper is tutorial. We wish ...

  • Amorphous Computing 

    Unknown author (1999-08-29)
    Amorphous computing is the development of organizational principles and programming languages for obtaining coherent behaviors from the cooperation of myriads of unreliable parts that are interconnected in unknown, ...

  • Amorphous Computing 

    Unknown author (2007)
    The goal of amorphous computing is to identify organizationalprinciples and create programming technologies for obtainingintentional, pre-specified behavior from the cooperation of myriadunreliable parts that are arranged ...

  • Amorphous Infrastructure for Language Implementation 

    Unknown author (2002-12-10)
    We propose a method for the robust implementation of simple graphical automataon an amorphous computer. This infrastructure is applied to the implementationof purely functional programming languages. Specifically, it is ...

  • Amorphous Medium Language 

    Unknown author (2005-07)
    Programming reliable behavior on a large mesh network composed of unreliable parts is difficult. Amorphous Medium Language addresses this problem by abstracting robustness and networking issues away from the programmer via ...

  • An Algorithm for Deciding BAPA: Boolean Algebra with Presburger Arithmetic 

    Unknown author (2004-07-19)
    We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmetic operations (PA). BAPA can express the ...

  • An Analysis of Posynomial MOSFET Models Using Genetic Algorithms and Visualization 

    Unknown author (2007-06-05)
    Analog designers are interested in optimization tools which automate the process of circuit sizing. Geometric programming, which uses posynomial models of MOSFET parameters, represents one such tool. Genetic algorithms ...

  • An Expectation Maximization Approach for Integrated Registration, Segmentation, and Intensity Correction 

    Unknown author (2005-04-01)
    This paper presents a statistical framework which combines the registration of an atlas with the segmentation of MR images. We use an Expectation Maximization-based algorithm to find a solution within the model, which ...

  • Analog "Neuronal" Networks in Early Vision 

    Unknown author (1985-06-01)
    Many problems in early vision can be formulated in terms of minimizing an energy or cost function. Examples are shape-from-shading, edge detection, motion analysis, structure from motion and surface interpolation ...

  • An Analog Model of Computation for the Ill-Posed Problems of Early Vision 

    Unknown author (1984-05-01)
    A large gap exists at present between computational theories of vision and their possible implementation in neural hardware. The model of computation provided by the digital computer is clearly unsatisfactory for the ...

  • An Analog VLSI Chip for Estimating the Focus of Expansion 

    Unknown author (1996-08-21)
    For applications involving the control of moving vehicles, the recovery of relative motion between a camera and its environment is of high utility. This thesis describes the design and testing of a real-time analog ...

  • Analogical Retrieval via Intermediate Features: The Goldilocks Hypothesis 

    Unknown author (2006-11-07)
    Analogical reasoning has been implicated in many important cognitive processes, such as learning, categorization, planning, and understanding natural language. Therefore, to obtain a full understanding of these processes, ...

  • Analsysis by Propagation of Constraints in Elementary Geometry Problem Solving 

    Unknown author (MIT Artificial Intelligence Laboratory, 1976-06)
    This paper describes GEL, a new geometry theorem prover. GEL is the result of an attempt to transfer the problem solving abilities of the EL electronic circuit analysis program of Sussman and Stallman to the domain of ...