Browsing Computer Science and Artificial Intelligence Lab (CSAIL) by Title
Now showing items 768-787 of 3804
-
Core Count vs Cache Size for Manycore Architectures in the Cloud
(2010-02-11)The number of cores which fit on a single chip is growing at an exponential rate while off-chip main memory bandwidth is growing at a linear rate at best. This core count to off-chip bandwidth disparity causes per-core ... -
Corpus-Based Techniques for Word Sense Disambiguation
(1998-05-27)The need for robust and easily extensible systems for word sense disambiguation coupled with successes in training systems for a variety of tasks using large on-line corpora has led to extensive research into corpus-based ... -
Correction of Force Errors for Flexible Manipulators in Quasi-Static Conditions
(MIT Artificial Intelligence Laboratory, 1990-12)This paper deals with the problem of controlling the interactions of flexible manipulators with their environment. For executing a force control task, a manipulator with intrinsic (mechanical) compliance has some advantages ... -
Correctness Conditions for Highly Available Replicated Databases
(1986-06)Correctness conditions are given which describe some of the properties exhibited by highly available distributed database systems such as the SHARD (System for Highly Available Replicated Data) system currently being ... -
Correctness of Communications Protocols, A case Study
(1993-11)During the past few years, the technology for formal specification and verification of communication protocols has matured to the point where we believe that it now provides practical assistance for protocol design and validation. -
Correctness Proof for a Network Synchronizer
(1993-12)In this paper we offer a formal, rigorous proof of the correctness of Awerbuch's algorithm for network synchronization [1]. We specify both the algorithm and the correctness condition using the I/O automaton model. -
A Correctness Proof for a Practical Byzantine-Fault-Tolerant Replication Algorithm
(1999-06)We have developed a practical algorithm for state-machine replication [7,11] that tolerates Byzantine faults. The algorithm is described in [4]. It offers a strong safety property - it implements a linearizable [5] object ... -
Correspondence and Affine Shape from Two Orthographic Views: Motion and Recognition
(1991-12-01)The paper presents a simple model for recovering affine shape and correspondence from two orthographic views of a 3D object. It is shown that four corresponding points along two orthographic views, taken under similar ... -
Cost Analysis of Debugging Systems
(1971-09)A general method is presented for performing cost analysis of interactive debugging systems. The method is based on an abstract model of program execution. This model is derived from the interpreter used in the Vienna ... -
The Cost of Global Broadcast Using Abstract MAC Layers
(2010-02-09)We analyze greedy algorithms for broadcasting messages throughout a multi-hop wireless network, using a slot-based model that includes message collisions without collision detection. Our algorithms are split formally into ... -
Cost-sensitive Analysis of Communication Protocols
(1991-06)This paper introduces the notion of cost-sensitive communication complexity and exemplifies it on the following basic communication problems: computing a global function, network synchornization, clock synchronization, ... -
A Counterexample to the Theory that Vision Recovers Three-Dimensional Scenes
(MIT Artificial Intelligence Laboratory, 1988-11)The problem of three-dimensional vision is generally formulated as the problem of recovering the three-dimensional scene that caused the image. Here we present a certain line-drawing and show that it has the following ... -
Counterfactual Explanations and Predictive Models to Enhance Clinical Decision-Making in Schizophrenia using Digital Phenotyping
(2023-06-15)Clinical practice in psychiatry is burdened with the increased demand for healthcare services and the scarce resources available. New paradigms of health data powered with machine learning techniques could open the possibility ... -
Counting Networks
(1991-06)Many fundamental multi-processor coordination problems can be expressed as counting problems: processes must cooperate to assign successive values from a given range, such as addresses in memory of destinations on an ... -
The Coupled Depth/Slope Approach to Surface Reconstruction
(1986-06-01)Reconstructing a surface from sparse sensory data is a well known problem in computer vision. Early vision modules typically supply sparse depth, orientation and discontinuity information. The surface reconstruction ... -
A Coupled Multi-ALU Processing Node for a Highly Parallel Computer
(1992-09-01)This report describes Processor Coupling, a mechanism for controlling multiple ALUs on a single integrated circuit to exploit both instruction-level and inter-thread parallelism. A compiler statically schedules individual ... -
Covering Graphs by Simple Circuits
(1980-02) -
CPHash: A Cache-Partitioned Hash Table
(2011-11-26)CPHash is a concurrent hash table for multicore processors. CPHash partitions its table across the caches of cores and uses message passing to transfer lookups/inserts to a partition. CPHash's message passing avoids the ... -
Creating a Computer-based Learning Environment for Physically Handicapped Children
(1983-09)The objective of this research is to develop a computer-based learning environment for children physically handicapped by cerebral palsy and to study several issues related to the use of this environment for diagnostic, ...
