Browsing Computer Science and Artificial Intelligence Lab (CSAIL) by Title
Now showing items 1587-1606 of 3804
-
Implementation of a Theory of Edge Detection
(1980-04-01)This report describes the implementation of a theory of edge detection, proposed by Marr and Hildreth (1979). According to this theory, the image is first processed independently through a set of different size filters, ... -
An Implementation Scheme for Array Operations in Static Data Flow Computers
(1982-05)The mapping of array operations in VAL programs on a static data flow machine with array memory is studied. The flow dependency graph is introduced as a model of array operations in VAL programs. The balancing and ... -
Implementing Asynchronous Distributed Systems Using the IOA Toolkit
(2004-10-06)This document is a report about the capabilities and performance of the IOA Toolkit, and in particularthe tools that provide support for implementing and running distributed systems (checker,composer, code generator). The ... -
Implementing Atomic Data through Indirect Learning in Dynamic Network
(2006-10-12)Developing middleware services for dynamic distributed systems, e.g., ad-hoc networks, is a challenging task given that suchservices must deal with communicating devices that may join and leave the system, and fail or ... -
Implementing Distributed Systems Using Linear Naming
(1993-03-01)Linear graph reduction is a simple computational model in which the cost of naming things is explicitly represented. The key idea is the notion of "linearity". A name is linear if it is only used once, so with linear ... -
Implementing Internet Remost Logic on a Personal Computer
(1982-12)This thesis demonstrates that a desktop personal computer can support an efficient internet remote login implementation with the same protocols used by large mainframes. It describes a project in which the Telnet remote ... -
Implementing Multi-process Primitives in a Multiplexed Computer System
(1968-11)In any computer system primitive functions are needed to control the actions of processes in the system. This thesis discusses a set of six such process control primitives which are sufficient to solve many of the problems ... -
Implementing Probabilistically Checkable Proofs of Proximity
(2005-08-08)Abstract: In this paper, we describe a proof-of-concept implementation of the probabilistically checkable proof of proximity (PCPP) system described by Ben-Sasson and Sudan in \\cite{bs05}. In particular, we implement a ... -
Implementing Sequentially Consistant Shared Objects using Broadcast and Point-To-Point Communications
(1995-06)A distributed algorithm that implements a sequentially consistent collection of shared read/update objects using a combination of broadcast and point-to-point communication is presented and proved correct. This algorithm ... -
Implementing Universal Computation in an Evolutionary System
(2002-07-01)Evolutionary algorithms are a common tool in engineering and in the study of natural evolution. Here we take their use in a new direction by showing how they can be made to implement a universal computer. We consider ... -
The Implication Problem for Functional and Inclusion Dependencies
(1983-02)There are two implication problems for functional dependencies and inclusion dependencies: general implication and finite implication. Given a set of dependencies ∑∪{σ}, the problems are to determine whether σ holds in all ... -
The Implicit Constraints of the Primal Sketch
(1981-10-01)Computational theories of structure-from-motion and stereo vision only specify the computation of three-dimensional surface information at points in the image at which the irradiance changes. Yet, the visual perception ... -
Importance Sampling for Reinforcement Learning with Multiple Objectives
(2001-08-01)This thesis considers three complications that arise from applying reinforcement learning to a real-world application. In the process of using reinforcement learning to build an adaptive electronic market-maker, we find ... -
Impossibility of boosting distributed service resilience
(2005-02-25)We prove two theorems saying that no distributed system in whichprocesses coordinate using reliable registers and f-resilient servicescan solve the consensus problem in the presence of f+1 undetectableprocess stopping ... -
Impossibility of Distributed Consensus with One Faulty Process*atio
(1982-09)The consensus problem involves an asynchronous system of processes, some of which may be unreliable. The problem is for the reliable processes to agree on a binary value. We show that every protocol for this problem has ... -
Improved Bounds on the Costs of Optimal and Balanced Binary Search Trees
(1975-11)A binary search tree can be used to store data in a computer system for retrieval by name. Different elements in the tree may be referenced with different probabilities. If we define the cost of the tree as the average ... -
Improved Caching Strategies for Publish/Subscribe Internet Networking
(2015-01-31)The systemic structure of TCP/IP is outdated; a new scheme for data transportation is needed in order to make the internet more adaptive to modern demands of mobility, information-driven demand, ever-increasing quantity ... -
An Improved Overlap Argument for On-line Multiplication
(1974-01)A lower bound of cN1ogN is proved for the mean time complexity of an on-line multitape Turing machine performing the multiplication of N-digit binary integers. For a more general class of machines the corresponding bound ... -
An Improved Proof of the Rabin-Harmanis-Stearns Conjecture
(1979-01)We offer an improved presentation of Aanderaa's constructive proof of the Rabin-Hartmanis-Stearns conjecture: For all k≥2, there exists a language Lk such that Lk can be recoginzed by a k-worktape real time Turing machine ...
