Search
Now showing items 121-130 of 151
Alloy*: A Higher-Order Relational Constraint Solver
(2014-09-02)
The last decade has seen a dramatic growth in the use of constraint solvers as a computational mechanism, not only for analysis and synthesis of software, but also at runtime. Solvers are available for a variety of logics ...
A Coded Shared Atomic Memory Algorithm for Message Passing Architectures
(2014-08-01)
This paper considers the communication and storage costs of emulating atomic (linearizable) multi-writer multi-reader shared memory in distributed message-passing systems. The paper contains three main contributions: (1) ...
Autotuning Algorithmic Choice for Input Sensitivity
(2014-06-23)
Empirical autotuning is increasingly being used in many domains to achieve optimized performance in a variety of different execution environments. A daunting challenge faced by such autotuners is input sensitivity, where ...
Latent Case Model: A Generative Approach for Case-Based Reasoning and Prototype Classification
(2014-05-26)
We present a general framework for Bayesian case-based reasoning and prototype classification and clustering -- Latent Case Model (LCM). LCM learns the most representative prototype observations of a dataset by performing ...
Quaternionic Representation of the Riesz Pyramid for Video Magnification
(2014-04-26)
Recently, we presented a new image pyramid, called the Riesz pyramid, that uses the Riesz transform to manipulate the phase in non-oriented sub-bands of an image sequence to produce real-time motion-magnified videos. In ...
Energy-Efficient Approximate Computation in Topaz
(2014-08-19)
We present Topaz, a new task-based language for computations that execute on approximate computing platforms that may occasionally produce arbitrarily inaccurate results. The Topaz implementation maps approximate tasks ...
Possibilistic Beliefs and Higher-Level Rationality
(2014-06-09)
We consider rationality and rationalizability for normal-form games of incomplete information in which the players have possibilistic beliefs about their opponents. In this setting, we prove that the strategies compatible ...
Possibilistic Beliefs and Higher-Level Rationality
(2014-06-09)
We consider rationality and rationalizability for normal-form games of incomplete information in which the players have possibilistic beliefs about their opponents. In this setting, we prove that the strategies compatible ...
Network Infusion to Infer Information Sources in Networks
(MIT CSAIL, 2014-12-02)
Several models exist for diffusion of signals across biological, social, or engineered networks. However, the inverse problem of identifying the source of such propagated information appears more difficult even in the ...
tBurton: A Divide and Conquer Temporal Planner
(2014-10-24)
Planning for and controlling a network of interacting devices requires a planner that accounts for the automatic timed transitions of devices while meeting deadlines and achieving durative goals. For example, a planner for ...