Browsing Computer Science and Artificial Intelligence Lab (CSAIL) by Title
Now showing items 3674-3693 of 3804
-
VAL- A Value-oriented Algorithmic Language: Preliminary Reference Manual
(1979-06)The programming language VAL (Value-Oriented Algorithmic Language) is designed for expressing algorithms for execution on computers capable of highly concurrent operation. More specifically, the application area to be ... -
Value-Deviation-Bounded Serial Data Encoding for Energy-Efficient Approximate Communication
(2015-06-04)Transferring data between ICs accounts for a growing proportion of system power in wearable and mobile systems. Reducing signal transitions reduces the dynamic power dissipated in this data transfer, but traditional ... -
Variable Precision Logic
(1985-08-01)Variable precision logic is concerned with problems of reasoning with incomplete information and under time constraints. It offers mechanisms for handling trade-offs between the precision of inferences and the ... -
The Variational Approach to Shape from Shading
(1985-03-01)We develop a systematic approach to the discovery of parallel iterative schemes for solving the shape-from-shading problem on a grid. A standard procedure for finding such schemes is outlines, and subsequently used ... -
A Vector Signal Processing Approach to Color
(1992-01-01)Surface (Lambertain) color is a useful visual cue for analyzing material composition of scenes. This thesis adopts a signal processing approach to color vision. It represents color images as fields of 3D vectors, from ... -
Vector-Based Integration of Local and Long-Range Information in Visual Cortex
(1996-01-18)Integration of inputs by cortical neurons provides the basis for the complex information processing performed in the cerebral cortex. Here, we propose a new analytic framework for understanding integration within ... -
Vectorizing Face Images by Interpreting Shape and Texture Computations
(1995-09-01)The correspondence problem in computer vision is basically a matching task between two or more sets of features. In this paper, we introduce a vectorized image representation, which is a feature-based representation where ... -
Velocity Space and the Geometry of Planetary Orbits
(1974-12-01)We develop a theory of orbits for the inverse-square central force law which differs considerably from the usual deductive approach. In particular, we make no explicit use of calculus. By beginning with qualitative ... -
Verb Classes and Alternations in Bangla, German, English, and Korean
(1996-05-06)In this report, we investigate the relationship between the semantic and syntactic properties of verbs. Our work is based on the English Verb Classes and Alternations of (Levin, 1993). We explore how these classes are ... -
Verbal and Graphical Language for the AED System: A Progress Report
(1964-05)For Computer-Aided Design, use of time-sharing a single language which can take either verbal or graphical form is required. This paper describes how a single language processing technique, which is in turn a special ... -
Verifiable Secret Sharing as Secure Computation
(1994-03)We present a stronger notion of verifiable secret sharing and exhibit a protocol implementing it. We show that our new notion is preferable to the old ones whenever verifiable secret sharing is used as a tool within larger ... -
Verifiably Secure Devices
(2007-12-05)We put forward the notion of a verifiably secure device, in essence a stronger notion of secure computation, and achieve it in the ballot-box model. Verifiably secure devices1. Provide a perfect solution to the problem of ... -
Verification of Programs Operating on Structured Data
(1974-03)The major method for verifying the correctness of computer program is the inductive assertion approach. This approach has been limited in the past by the lack of techniques for handling data structures. In particular, ... -
Verification of Semantic Commutativity Conditions and Inverse Operations on Linked Data Structures
(2010-12-03)Commuting operations play a critical role in many parallel computing systems. We present a new technique for verifying commutativity conditions, which are logical formulas that characterize when operations commute. Because ... -
Verification of the Randomized Consensus Algorithm of Aspnes and Herlihy: a Case Study*
(1997-06)The Probabilistic I/O Automaton model of [20] is used as the basis for a formal presentation and proof of the randomized consensus algorithm of Aspnes and Herlihy. The algorithm guarantees termination within expected ... -
Verifying Quantitative Reliability of Programs That Execute on Unreliable Hardware
(2013-06-19)Emerging high-performance architectures are anticipated to contain unreliable components that may exhibit soft errors, which silently corrupt the results of computations. Full detection and recovery from soft errors is ... -
Verifying the Correctness of Wide-Area Internet Routing
(2004-05-17)Several studies have shown that wide-area Internet routing is fragile, with failures occurring for a variety of reasons. Routing fragility is largely due to the flexible and powerful ways in which BGP can be configured to ... -
Versatility and VersaBench: A New Metric and a Benchmark Suite for Flexible Architectures
(2004-06-14)For the last several decades, computer architecture research has largely benefited from, and continues to be driven by ad-hoc benchmarking. Often the benchmarks are selected to represent workloads that architects believe ... -
Vertical Image Registration in Stereopsis
(1983-10-01)Most computational theories of stereopsis require a registration stage prior to stereo matching to reduce the matching to a one-dimensional search. Even after registration, it is critical that the stereo matching process ...
