Browsing Computer Science and Artificial Intelligence Lab (CSAIL) by Title
Now showing items 1249-1268 of 3804
-
Faster Dynamic Controllability Checking in Temporal Networks with Integer Bounds
(International Joint Conference in Artificial Intelligence, 2019-08)Simple Temporal Networks with Uncertainty (STNUs) provide a useful formalism with which to reason about events and the temporal constraints that apply to them. STNUs are in particular notable because they facilitate reasoning ... -
The Fastest Fourier Transform in the West
(1997-09) -
Fat-Tree Routing for Transit
(1990-02-01)The Transit network provides high-speed, low-latency, fault-tolerant interconnect for high-performance, multiprocessor computers. The basic connection scheme for Transit uses bidelta style, multistage networks to ... -
Fault Tolerance in Packet Communication Computer Archiectures
(1980-12)It is attractive to implement a large scale parallel processing system as a self-timed hardware system with decentralized control and to improve maintainability and availability in such a system through fault tolerance. ... -
Fault-Tolerant Design for Multistage Routing Networks
(1990-04-01)As the size of digital systems increases, the mean time between single component failures diminishes. To avoid component related failures, large computers must be fault-tolerant. In this paper, we focus on methods for ... -
A Fault-tolerant Network Kernel for Linda
(1988-08)The parallel programming system Linda consists of a number of processes and a shared memory called the tuple space. In a distributed implementation of Linda, processes and the tuple space reside on different computing ... -
Feature Extraction Without Edge Detection
(1993-09-01)Information representation is a critical issue in machine vision. The representation strategy in the primitive stages of a vision system has enormous implications for the performance in subsequent stages. Existing ... -
Feature Matching for Object Localization in the Presence of Uncertainty
(1990-05-01)We consider the problem of matching model and sensory data features in the presence of geometric uncertainty, for the purpose of object localization and identification. The problem is to construct sets of model feature and ... -
Feature Point Detection and Curve Approximation for Early Processing of Freehand Sketches
(2001-05-01)Freehand sketching is both a natural and crucial part of design, yet is unsupported by current design automation software. We are working to combine the flexibility and ease of use of paper and pencil with the processing ... -
Feature Point Generation Programs
(MIT Artificial Intelligence Laboratory, 1971)The programs in this set extract, from a raster of intensity values over some scene, a set of points which are adjudged to lie along the boundaries of objects in the scene. Intensities may be obtained directly from the new ... -
Feature Selection for Face Detection
(2000-09-01)We present a new method to select features for a face detection system using Support Vector Machines (SVMs). In the first step we reduce the dimensionality of the input space by projecting the data into a subset of ... -
FED, the Font "EDitor" and Font Formats
(MIT Artificial Intelligence Laboratory, 1974-10)This memo describes FED, a program used for compiling and inspecting fonts: AST font format, a text format which can be used to create and edit fonts: and KST font format, the binary format used by SCRIMP, TJ6, and PUB. -
Figure Boundary Description Routings for the PDP-6sVision Project
(1966-09-01)As a step in the direction of "computer vision," several programs have been written which transform the output of a vidisector into some mathematical descriptions of the boundaries enclosing the objects in the field of ... -
A File Location, Replication, and Distribution System for Network Information to Aid Network Management
(2010-09-22)This thesis demonstrates and evaluates the design, architecture, and implementation of a file location, replication, and distribution system built with the objective of managing information in an Internet network. The ... -
File Management and Related Topics, June 12, 1970
(1970-09)The subject of these notes is file management. We will develop the problems of file management within the environment of a large information and computing service, often called a computer utility or general purpose ... -
File Synchronization with Vector Time Pairs
(2005-02-28)Vector time pairs are a new method for trackingsynchronization metadata. A vector time pairconsists of two vector times: one tracking filemodification history and one tracking filesynchronization history. Because the ... -
File Systems with Multiple File Implementations
(1992-02)This thesis proposes ideas for designing file system software for the large, high-performance file server hardware we feel will be common in the middle to late nineties. In particular, the thesis examines the value and ... -
A File Transfer Program for a Personal Computer
(1982-04)This thesis explores engineering decisions involved in implementing a network file transfer program on a personal computer in response to criteria of low cost and reasonable efficiency. The issues include choice of hardware, ... -
Filling in the Gaps: The Shape of Subjective Contours and a Model for Their Generation
(1976-10-01)The properties of isotropy, smoothness, minimum curvature and locality suggest the shape of filled-in contours between two boundary edges. The contours are composed of the arcs of two circles tangent to the given ... -
Filtered Iterators For Safe and Robust Programs in RIFL
(2015-12-27)We present a new language construct, filtered iterators, for safe and robust input processing. Filtered iterators are designed to eliminate many common input-processing errors while enabling robust continued execution. The ...
