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

Now showing items 261-280 of 2625

  • Bringing the Grandmother Back into the Picture: A Memory-Based View of Object Recognition 

    Unknown author (1990-04-01)
    We describe experiments with a versatile pictorial prototype based learning scheme for 3D object recognition. The GRBF scheme seems to be amenable to realization in biophysical hardware because the only kind of ...

  • Broadcasting in Unreliable Radio Networks 

    Unknown author (2010-06-08)
    Practitioners agree that unreliable links, which fluctuate between working and not working, are an important characteristic of wireless networks. In contrast, most theoretical models of radio networks fix a static set of ...

  • BUILD -- A System Construction Tool 

    Unknown author (MIT Artificial Intelligence Laboratory, 1984-08)
    BUILD is a proposed tool for constructing systems from existing modules. BUILD system descriptions are composed of module declarations and assertions of how modules refer to each other. An extensible library of information ...

  • BUILD: A Tool for Maintaining Consistency in Modular Systems 

    Unknown author (1985-11-01)
    Build is a tool for keeping modular systems in a consistent state by managing the construction tasks (e.g. compilation, linking, etc.) associated with such systems. It employs a user supplied system model and a ...

  • Building Brains for Bodies 

    Unknown author (1993-08-01)
    We describe a project to capitalize on newly available levels of computational resources in order to understand human cognition. We will build an integrated physical system including vision, sound input and output, and ...

  • Building English Explanations from Function Descriptions 

    Unknown author (MIT Artificial Intelligence Laboratory, 1979-04)
    An explanatory component is an important ingredient in any complex AI system. A simple generative scheme to build descriptive phrases from Lisp function calls can produce respectable explanations if explanation generators ...

  • Building Grounded Abstractions for Artificial Intelligence Programming 

    Unknown author (2004-06-16)
    Most Artificial Intelligence (AI) work can be characterized as either ``high-level'' (e.g., logical, symbolic) or ``low-level'' (e.g., connectionist networks, behavior-based robotics). Each approach suffers from particular ...

  • Building Grounded Abstractions for Artificial Intelligence Programming 

    Unknown author (2004-06-16)
    Most Artificial Intelligence (AI) work can be characterized as either ``high-level'' (e.g., logical, symbolic) or ``low-level'' (e.g., connectionist networks, behavior-based robotics). Each approach suffers from particular ...

  • Building Spatial Computers 

    Unknown author (2007-03-14)
    Programmability is a major challenge in spatial computing, anaggregate control problem found in domains such as sensor networks,swarm robotics, and modular robotics. We address this challenge witha model of a spatial ...

  • Byzantine Clients Rendered Harmless 

    Unknown author (2005-07-21)
    Byzantine quorum systems have been proposed that work properly even when up to f replicas fail arbitrarily.However, these systems are not so successful when confronted with Byzantine faulty clients. This paper presents ...

  • Byzantine Fault Tolerance in Long-Lived Systems 

    Unknown author (2004-08-13)
    This paper proposes counter-measures that can be deployedas part of a replicated system to reduce the size ofW, and thus reduce the class of attacks to which the system is vulnerable. Obviously it will not be possible to ...

  • Cabernet: A Content Delivery Network for Moving Vehicles 

    Unknown author (2008-01-17)
    This paper describes the design, implementation, and evaluation of Cabernet, a system to deliver data to and from moving vehicles using open 802.11 (WiFi) access points encountered opportunistically during travel. Network ...

  • Cache Calculus: Modeling Caches through Differential Equations 

    Unknown author (2015-12-19)
    Caches are critical to performance, yet their behavior is hard to understand and model. In particular, prior work does not provide closed-form solutions of cache performance, i.e. simple expressions for the miss rate of a ...

  • A Cache Model for Modern Processors 

    Unknown author (2015-04-09)
    Modern processors use high-performance cache replacement policies that outperform traditional alternatives like least-recently used (LRU). Unfortunately, current cache models use stack distances to predict LRU or its ...

  • CADR 

    Unknown author (1979-05-01)
    The CADR machine, a revised version of the CONS machine, is a general-purpose, 32-bit microprogrammable processor which is the basis of the Lisp-machine system, a new computer system being developed by the Laboratory ...

  • The Calcomp Plotter as an Output Device 

    Unknown author (1967-07-01)
    (1)CHAR PLOT (see AI Memo 125) has been modified for TS. [It may be found on MS4 with the non-TS version]. The following changes should be noted: CRKBRK (now called PLTBRK in the non-TS CHAR PLOT), SUBPLT (which is ...

  • Calculating the Reflectance Map 

    Unknown author (1978-10-01)
    It appears that the development of machine vision may benefit from a detailed understanding of the imaging process. The reflectance map, showing scene radiance as a function of surface gradient, has proved to be helpful ...

  • Calculation of Blocking Probabilities in Multistage Interconnection Networks with Redundant Paths 

    Unknown author (1991-12-01)
    The blocking probability of a network is a common measure of its performance. There exist means of quickly calculating the blocking probabilities of Banyan networks; however, because Banyan networks have no redundant ...

  • Can Basic ML Techniques Illuminate Rateless Erasure Codes? 

    Unknown author (2004-05-05)
    The recently developed rateless erasure codes are a near-optimal channel coding technique that guaranteeslow overhead and fast decoding. The underlying theory, and current implementations, of thesecodes assume that a network ...

  • Capacity Allocation in Wireless LANs 

    Unknown author (2004-11-12)
    Today's access point based wireless LANs (WLANs) are inefficient and unfair. For many traffic loads they provide far less total throughput than they should, and do a poor job allocating what throughput they do deliver. ...