Search
Now showing items 3401-3410 of 4210
Analyzing the State Behavior of Programs
(MIT Artificial Intelligence Laboratory, 1988-08)
It is generally agreed that the unrestricted use of state can make a program hard to understand, hard to compile, and hard to execute, and that these difficulties increase in the presence of parallel hardware. This problem ...
Parallel Flow Graph Matching for Automated Program Recognition
(MIT Artificial Intelligence Laboratory, 1988-07)
A flow graph matching algorithm has been implemented on the Connection Machine which employs parallel techniques to allow efficient subgraph matching. By constructing many different matchings in parallel, the algorithm is ...
Support for Obviously Synchonizable Series Expressions in Pascal
(MIT Artificial Intelligence Laboratory, 1988-11)
Obviously synchronizable series expressions enable programmers to write algorithms as straightforward compositions of functions rather than as less comprehensible loops while retaining the significantly higher efficiency ...
Further Evidence Against the Recovery Theory of Vision
(MIT Artificial Intelligence Laboratory, 1989-02)
The problem of three-dimensional vision is generally formulated as the problem of recovering the three-dimensional scene that caused the image.
We have previously presented a certain line-drawing and shown that it has the ...
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 ...
A Partial Mechanical Design Compiler
(MIT Artificial Intelligence Laboratory, 1987-02)
I have implemented a simple "mechanical design compiler", that is a program which can convert high-level descriptions of a mechanical design into detail descriptions. (Human interaction is sometimes required.) The program ...
How to do Research At the MIT AI Lab
(MIT Artificial Intelligence Laboratory, 1988-10)
This document presumptuously purports to explain how to do research. We give heuristics that may be useful in pickup up specific skills needed for research (reading, writing, programming) and for understanding and enjoying ...
Matching Sets of Features for Efficient Retrieval and Recognition
(2006-08-11)
In numerous domains it is useful to represent a single example by the collection of local features or parts that comprise it. In computer vision in particular, local image features are a powerful way to describe images of ...
Agent Organization in the Knowledge Plane
(2008-06-11)
In designing and building a network like the Internet, we continue to face the problems of scale and distribution. With the dramatic expansion in scale and heterogeneity of the Internet, network management has become an ...
The SoftPHY Abstraction: from Packets to Symbols in Wireless Network Design
(2008-06-03)
At ever-increasing rates, we are using wireless systems to communicatewith others and retrieve content of interest to us. Current wirelesstechnologies such as WiFi or Zigbee use forward error correction todrive bit error ...