Search
Now showing items 81-90 of 290
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 ...
Automatic Error Finding in Access-Control Policies
(2010-05-05)
Access-control policies are a key infrastructural technology for computer security. However, a significant problem is that system administrators need to be able to automatically verify whether their policies capture the ...
Kongming: A Generative Planner for Hybrid Systems with Temporally Extended Goals
(2010-04-09)
Most unmanned missions in space and undersea are commanded by a "script" that specifies a sequence of discrete commands and continuous actions. Currently such scripts are mostly hand-generated by human operators. This ...