Open Access Repositories: Recent submissions
Now showing items 2601-2620 of 4204
-
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. ...
-
Component based recognition of objects in an office environment
(2003-11-28)We present a component-based approach for recognizing objectsunder large pose changes. From a set of training images of a givenobject we extract a large number of components which are clusteredbased on the similarity of ...
-
Finding Longest Increasing and Common Subsequences in Streaming Data
(2003-11-26)In this paper, we present algorithms and lower bounds for the Longest Increasing Subsequence(LIS) and Longest Common Subsequence (LCS) problems in the data streaming model.
-
The Satisfiability Threshold of Random 3-SAT Is at Least 3.52
(2003-11-20)We prove that a random 3-SAT instance with clause-to-variable densityless than 3.52 is satisfiable with high probability.The proof comes through an algorithm which selects (and sets) a variabledepending on its degree and ...
-
Efficient Specification-Assisted Error Localization and Correction
(2003-11-13)We present a new error localization tool, Archie, that accepts aspecification of key data structure consistency constraints, then generatesan algorithm that checks if the data structures satisfy theconstraints. We also ...
-
Scalable Internet Routing on Topology-Independent Node Identities
(2003-10-31)Unmanaged Internet Protocol (UIP) is a fully selforganizingnetwork-layer protocol that implements scalableidentity-based routing. In contrast with addressbasedrouting protocols, which depend for scalability oncentralized ...
-
Evolving Robocode Tank Fighters
(2003-10-28)In this paper, I describe the application of genetic programming to evolve a controller for a robotic tank in a simulated environment.The purpose is to explore how genetic techniques can best be applied to produce controllers ...
-
On Role Logic
(2003-10-24)We present role logic, a notation for describing propertiesof relational structures in shape analysis, databases, andknowledge bases. We construct role logic using the ideas ofde Bruijn's notation for lambda calculus, an ...
