Computer Science and Artificial Intelligence Lab (CSAIL): Recent submissions
Now showing items 1021-1040 of 2625
-
Converting Java Programs to Use Generic Libraries
(2004-03-30)Java 1.5 will include a type system (called JSR-14) that supports parametric polymorphism, or generic classes. This will bring many benefits to Java programmers, not least because current Java practice makes heavy use of ...
-
Predicting Problems Caused by Component Upgrades
(2004-03-30)This report presents a new, automatic technique to assess whether replacing a component of a softwaresystem by a purportedly compatible component may change the behavior of the system. The techniqueoperates before integrating ...
-
Evaluation of sets of oriented and non-oriented receptive fields as local descriptors
(2004-03-24)Local descriptors are increasingly used for the task of object recognition because of their perceived robustness with respect to occlusions and to global geometrical deformations. We propose a performance criterion for a ...
-
Predicting Unroll Factors Using Nearest Neighbors
(2004-03-22)In order to deliver the promise of Moore s Law to the enduser, compilers must make decisions that are intimately tiedto a specific target architecture. As engineers add architecturalfeatures to increase performance, systems ...
-
REED: Robust, Efficient Filtering and Event Detection in Sensor Networks
(2004-03-22)This paper presents an algorithm for handling many types of filters insensor networks that cannot be expressed using a simple predicate.Specifically, the action of the filter may be predicated on sensor produceddata where ...
-
Face processing in humans is compatible with a simple shape-based model of vision
(2004-03-05)Understanding how the human visual system recognizes objects is one of the key challenges in neuroscience. Inspired by a large body of physiological evidence (Felleman and Van Essen, 1991; Hubel and Wiesel, 1962; Livingstone ...
-
Virtual Mobile Nodes for Mobile Ad Hoc Networks
(2004-02-26)One of the most significant challenges introduced by mobile networks is the difficulty in coping withthe unpredictable movement of mobile nodes. If, instead, the mobile nodes could be programmed totravel through the world ...
-
GeoQuorums: Implementing Atomic Memory in Mobile Ad Hoc Networks
(2004-02-25)We present a new approach, the GeoQuorums approach, for implementing atomic read/write shared memoryin mobile ad hoc networks. Our approach is based on associating abstract atomic objects with certain geographiclocations. ...
-
MultiChord: A Resilient Namespace Management Protocol
(2004-02-19)MultiChord is a new variant of the Chord namespace management algorithm [7] that includes lightweight mechanismsfor accommodating a limited rate of change, specifically, process joins and failures. This paper describes ...
-
New Architectural Models for Visibly Controllable Computing: The Relevance of Dynamic Object Oriented Architecturesand Plan Based Computing Models
(2004-02-09)Traditionally, we've focussed on the question of how to make a system easy to code the first time, or perhaps on how to ease the system's continued evolution. But if we look at life cycle costs, then we must conclude that ...
-
Enhancing Availability and Security Through Failure-Oblivious Computing
(2004-02-06)We present a new technique, failure-oblivious computing,that enables programs to continue to execute through memoryerrors without memory corruption. Our safe compilerfor C inserts checks that dynamically detect invalid ...
-
Virtual Visual Hulls: Example-Based 3D Shape Estimation from a Single Silhouette
(2004-01-28)Recovering a volumetric model of a person, car, or other objectof interest from a single snapshot would be useful for many computergraphics applications. 3D model estimation in general is hard, andcurrently requires active ...
-
Selecting Relevant Genes with a Spectral Approach
(2004-01-27)Array technologies have made it possible to record simultaneouslythe expression pattern of thousands of genes. A fundamental problemin the analysis of gene expression data is the identification ofhighly relevant genes that ...
-
Risk Bounds for Mixture Density Estimation
(2004-01-27)In this paper we focus on the problem of estimating a boundeddensity using a finite combination of densities from a givenclass. We consider the Maximum Likelihood Procedure (MLE) and the greedy procedure described by Li ...
-
On the difficulty of feature-based attentional modulations in visual object recognition: A modeling study.
(2004-01-14)Numerous psychophysical experiments have shown an important role for attentional modulations in vision. Behaviorally, allocation of attention can improve performance in object detection and recognition tasks. At the neural ...
-
On Modular Pluggable Analyses Using Set Interfaces
(2003-12-18)We present a technique that enables the focused applicationof multiple analyses to different modules in the same program. Our researchhas two goals: 1) to address the scalability limitations of preciseanalyses by focusing ...
-
Rosebud: A Scalable Byzantine-Fault-Tolerant Storage Architecture
(2003-12-17)This paper presents Rosebud, a new Byzantine faulttolerantstorage architecture designed to be highly scalableand deployable in the wide-area. To support massiveamounts of data, we need to partition the data among thenodes. ...
-
RamboNodes for the Metropolitan Ad Hoc Network
(2003-12-17)We present an algorithm to store data robustly in a large, geographically distributed network by means of localized regions of data storage that move in response to changing conditions. For example, data might migrate away ...
-
Fast Contour Matching Using Approximate Earth Mover's Distance
(2003-12-05)Weighted graph matching is a good way to align a pair of shapesrepresented by a set of descriptive local features; the set ofcorrespondences produced by the minimum cost of matching features fromone shape to the features ...
-
Mobilized ad-hoc networks: A reinforcement learning approach
(2003-12-04)Research in mobile ad-hoc networks has focused on situations in whichnodes have no control over their movements. We investigate animportant but overlooked domain in which nodes do have controlover their movements. ...