Search
Now showing items 321-330 of 4210
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. ...
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 ...
Distribution Volume Tracking on Privacy-Enhanced Wireless Grid
(2004-07-25)
In this paper, we discuss a wireless grid in which users are highly mobile, and form ad-hoc and sometimes short-lived connections with other devices. As they roam through networks, the users may choose to employ ...
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 ...
Contextual models for object detection using boosted random fields
(2004-06-25)
We seek to both detect and segment objects in images. To exploit both local image data as well as contextual information, we introduce Boosted Random Fields (BRFs), which uses Boosting to learn the graph structure and ...
Definition and Expansion of Composite Automata in IOA
(2004-07-19)
The IOA language provides notations for defining both primitive and composite I/O automata.This note describes, both formally and with examples, the constraints on these definitions, thecomposability requirements for the ...
Systematic Removal of Nondeterminism for Code Generation in I/O Automata
(2004-07-19)
The Input/Output (I/O) automaton model developed by Lynch and Tuttle models components in asynchronous concurrentsystems as labeled transition systems. IOA is a precise language for describing I/O automata and for stating ...
Discovering Latent Classes in Relational Data
(2004-07-22)
We present a framework for learning abstract relational knowledge with the aimof explaining how people acquire intuitive theories of physical, biological, orsocial systems. Our approach is based on a generative relational ...
A Constant-Factor Approximation Algorithm for Embedding Unweighted Graphs into Trees
(2004-07-05)
We present a constant-factor approximation algorithm for computing anembedding of the shortest path metric of an unweighted graph into atree, that minimizes the multiplicative distortion.