Browsing CSAIL Digital Archive by Title
Now showing items 42-61 of 806
-
Amorphous Computing
(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
(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
(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
(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
(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
(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 ... -
Analogical Retrieval via Intermediate Features: The Goldilocks Hypothesis
(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, ... -
An Analysis of Patch Plausibility and Correctness for Generate-And-Validate Patch Generation Systems
(2015-05-26)We analyze reported patches for three existing generate-and-validate patch generation systems (GenProg, RSRepair, and AE). The basic principle behind generate-and-validate systems is to accept only plausible patches that ... -
An Analysis of Patch Plausibility and Correctness for Generate-And-Validate Patch Generation Systems
(2015-05-29)We analyze reported patches for three existing generate-and-validate patch generation systems (GenProg, RSRepair, and AE). The basic principle behind generate-and-validate systems is to accept only plausible patches that ... -
An Analysis of Patch Plausibility and Correctness for Generate-And-Validate Patch Generation Systems
(2015-02-10)We analyze reported patches for three prior generate-and-validate patch generation systems (GenProg, RSRepair, and AE). Because of experimental error, the majority of the reported patches violate the basic principle behind ... -
An Analysis of Patch Plausibility and Correctness for Generate-And-Validate Patch Generation Systems (Supplementary Material)
(2015-05-21)We analyze reported patches for three prior generate-and-validate patch generation systems (GenProg, RSRepair, and AE). Because of errors in the patch evaluation infrastructure, the majority of the reported patches violate ... -
An Analysis of Patch Plausibility and Correctness for Generate-And-Validate Patch Generation Systems (Supplementary Material)
(2015-02-02)We analyze reported patches for three prior generate-and-validate patch generation systems (GenProg, RSRepair, and AE). Because of experimental error, the majority of the reported patches violate the basic principle behind ... -
Analysis of Perceptron-Based Active Learning
(2005-11-17)We start by showing that in an active learning setting, the Perceptron algorithm needs $\Omega(\frac{1}{\epsilon^2})$ labels to learn linear separators within generalization error $\epsilon$. We then present a simple ... -
An Analysis of the Search Spaces for Generate and Validate Patch Generation Systems
(2016-02-18)We present the first systematic analysis of the characteristics of patch search spaces for automatic patch generation systems. We analyze the search spaces of two current state-of- the-art systems, SPR and Prophet, with ... -
An Analyst's Assistant for the Interpretation of Vehicle Track Data
(2014-10-08)This report describes the Analyst's Assistant, a software system for language-interactive, collaborative user-system interpretation of events, specifically targeting vehicle events that can be recognized on the basis of ... -
Annotation Guide for the UCM/MIT Indications, Referential Expressions, and Coreference Corpus (UMIREC Corpus)
(2010-05-12)This is the annotation guide given to the annotators who created the UCM/MIT Indications, Referring Expressions, and Coreference (UMIREC) Corpus version 1.0. The corpus comprises texts annotated for referring expressions, ... -
Anthills Built to Order: Automating Construction with Artificial Swarms
(2006-05-12)Social insects build large, complex structures, which emerge through the collective actions of many simple agents acting with no centralized control or preplanning. These natural systems motivate investigating the use of ... -
Application Heartbeats for Software Performance and Health
(2009-08-07)Adaptive, or self-aware, computing has been proposed as one method to help application programmers confront the growing complexity of multicore software development. However, existing approaches to adaptive systems are ... -
Approximate Correspondences in High Dimensions
(2006-06-15)Pyramid intersection is an efficient method for computing an approximate partial matching between two sets of feature vectors. We introduce a novel pyramid embedding based on a hierarchy of non-uniformly shaped bins that ... -
Approximating Buy-at-Bulk k-Steiner trees
(2005-11-15)In the buy-at-bulk $k$-Steiner tree (or rent-or-buy$k$-Steiner tree) problem we are given a graph $G(V,E)$ with a setof terminals $T\subseteq V$ including a particular vertex $s$ calledthe root, and an integer $k\leq |T|$. ...