Now showing items 1254-1273 of 3804

    • A Fault-tolerant Network Kernel for Linda 

      Xu, Andrew S. (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 

      Chaney, Ronald D. (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 

      Cass, Todd Anthony (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 

      Sezgin, Tevfik Metin (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 

      Griffith, Arnold K. (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 

      Serre, Thomas; Heisele, Bernd; Mukherjee, Sayan; Poggio, Tomaso (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 

      Cohen, Joseph D.; Jarvis, J. Pitts (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 

      White, John (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 

      Cheng, Tiffany (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 

      Graham, Robert M. (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 

      Cox, Russ; Josephson, William (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 

      Stata, Raymie (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 

      Wright, Karl D. (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 

      Ullman, Shimon (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 

      Shen, Jiasi; Rinard, Martin (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 ...
    • Final Report of the Brookline LOGO Project. Part II: Project Summary and Data 

      Papert, Seymour A.; Watt, Daniel; diSessa, Andrea; Weir, Sylvia (1979-09-01)
      During the school year 1977/78 four computers equipped with LOGO and Turtle Graphics were installed in an elementary school in Brookline, Mass. All sixth grade students in the school had between 20 and 40 hours of ...
    • Final Report of the Brookline LOGO Project. Part III: Profiles of Individual Student's Work 

      Papert, Seymour A.; Watt, Daniel; diSessa, Andrea; Weir, Sylvia (1979-09-01)
      During the school year 1977/78 four computers equipped with LOGO and Turtle Graphics were installed in an elementary school in Brookline, Mass. All sixth grade students in the school had between 20 and 40 hours of ...
    • Final Report of the Multics Kernal Design Project 

      Schroeder, Michael D.; Clark, David D.; Saltzer, Jerome H.; Wells, D.H. (1978-03)
      We describe a plan to create an auditable version of Multics. The engineering experiments of that plan are now complete. Type extension as a design discipline has been demonstrated feasible, even for the internal workings ...
    • The Find-Path Problem in the Plane 

      Nguyen; Van-Duc (1984-02-01)
      This paper presents a fast heuristic algorithm for planning collision-free paths of a moving robot in a cluttered planar workspace. The algorithm is based on describing the free space between the obstacles as a network ...
    • Finding aircraft collision-avoidance strategies using policy search methods 

      Kaelbling, Leslie Pack; Lozano-Perez, Tomas (2009-09-12)
      A progress report describing the application of policy gradient and policy search by dynamic programming methods to an aircraft collision avoidance problem inspired by the requirements of next-generation TCAS.