Computer Science and Artificial Intelligence Lab (CSAIL): Recent submissions

Now showing items 361-380 of 2625

  • SoftCast: One Video to Serve All Wireless Receivers 

    Unknown author (2009-02-07)
    The main challenge in wireless video multicast is to scalably serve multiple receivers who have different channel characteristics. Current wireless transmission schemes, however, cannot support smooth degradation. Specifically, ...

  • HAMPI: A Solver for String Constraints 

    Unknown author (2009-02-04)
    Many automatic testing, analysis, and verification techniques for programs can be effectively reduced to a constraint-generation phase followed by a constraint-solving phase. This separation of concerns often leads to more ...

  • Self-Stabilizing Message Routing in Mobile ad hoc Networks 

    Unknown author (2009-01-28)
    We present a self-stabilizing algorithm for routing messages between arbitrary pairs of nodes in a mobile ad hoc network. Our algorithm assumes the availability of a reliable GPS service, which supplies mobile nodes with ...

  • The Art of the Propagator 

    Unknown author (2009-01-26)
    We develop a programming model built on the idea that the basic computational elements are autonomous machines interconnected by shared cells through which they communicate. Each machine continuously examines the cells it ...

  • Organic Indoor Location Discovery 

    Unknown author (2008-12-30)
    We describe an indoor, room-level location discovery method based on spatial variations in "wifi signatures," i.e., MAC addresses and signal strengths of existing wireless access points. The principal novelty of our system ...

  • Resilient Auctions of One Good in Limited Supply 

    Unknown author (2008-12-17)
    We present various resilient auction mechanisms for a good in limited supply. Our mechanisms achieve both player-knowledge and aggregated player-knowledge benchmarks.

  • Resilient Provision of a Public and/or Private Good, or: Resilient Auctions of One Good in Unlimited Supply 

    Unknown author (2008-12-02)
    We present two resilient mechanisms: the first for the provision of a public good, and the second for the provision of a private good. Both mechanisms adopt a knowledge-based benchmark.

  • Resilient Provision of a Public Good 

    Unknown author (2008-12-02)
    We present two resilient mechanisms for the provision of a public good. Both mechanisms adopt a knowledge-based benchmark.

  • Resilient Knowledge-Based Mechanisms For Truly Combinatorial Auctions (And Implementation in Surviving Strategies) 

    Silvio Micali; Theory of Computation (2008-10-08)
    We put forward a new mechanism achieving a high benchmark for (both revenue and) the sum of revenue and efficiency in truly combinatorial auctions. Notably, our mechanism guarantees its performance (1) in a very adversarial ...

  • Mathematics of the Neural Response 

    Unknown author (2008-11-26)
    We propose a natural image representation, the neural response, motivated by the neuroscience of the visual cortex. The inner product defined by the neural response leads to a similarity measure between functions which we ...

  • Stochastic Digital Circuits for Probabilistic Inference 

    Unknown author (2008-11-24)
    We introduce combinational stochastic logic, an abstraction that generalizes deterministic digital circuit design (based on Boolean logic gates) to the probabilistic setting. We show how this logic can be combined with ...

  • Modeling Computational Security in Long-Lived Systems, Version 2 

    Unknown author (2008-11-22)
    For many cryptographic protocols, security relies on the assumption that adversarial entities have limited computational power. This type of security degrades progressively over the lifetime of a protocol. However, some ...

  • Resilient Mechanisms For Truly Combinatorial Auctions 

    Unknown author (2008-11-13)
    Dominant-strategy truthfulness is traditionally considered the best possible solution concept in mechanism design, as it enables one to predict with confidence which strategies INDEPENDENT players will actually choose. ...

  • MOOS-IvP Autonomy Tools Users Manual 

    Unknown author (2008-11-11)
    This document describes seven common MOOS-IvP autonomy tools. The uHelmScope application provides a run-time scoping window into the state of an active IvP Helm executing its mission. The pMarineViewer application is a ...

  • Energy Scalability of On-Chip Interconnection Networks in Multicore Architectures 

    Unknown author (2008-11-11)
    On-chip interconnection networks (OCNs) such as point-to-point networks and buses form the communication backbone in systems-on-a-chip, multicore processors, and tiled processors. OCNs can consume significant portions of ...

  • Recursively invoking Linnaeus: A Taxonomy for Naming Systems 

    Unknown author (2002-03-01)
    Naming is a central element of a distributed or network system design. Appropriate design choices are central. This paper explores a taxonomy of naming systems, and engineering tradeoffs as an aid to the namespace designer. ...

  • One Video Stream to Serve Diverse Receivers 

    Unknown author (2008-10-18)
    The fundamental problem of wireless video multicast is to scalably serve multiple receivers which may have very different channel characteristics. Ideally, one would like to broadcast a single stream that allows each ...

  • Adaptive Kernel Methods Using the Balancing Principle 

    Unknown author (2008-10-16)
    The regularization parameter choice is a fundamental problem in supervised learning since the performance of most algorithms crucially depends on the choice of one or more of such parameters. In particular a main theoretical ...

  • Modular Generation and Customization 

    Unknown author (2008-10-10)
    Modularity and flexibility can conflict in multi-language systems. For example, the templates commonly used to generate web pages must be manually updated when the database schema changes. Modularity can be improved by ...

  • The Case for a Factored Operating System (fos) 

    Unknown author (2008-10-08)
    The next decade will afford us computer chips with 1,000 - 10,000 cores on a single piece of silicon. Contemporary operating systems have been designed to operate on a single core or small number of cores and hence are not ...