Browsing by Title

Now showing items 3352-3371 of 4783

  • The Projective Approach to Object Description 

    Unknown author (MIT Artificial Intelligence Laboratory, 1972-12-15)
    A methodology is presented for generating descriptions of objects from line drawings. Using projection of planes, objects in a scene can be parsed and described at the same time. The descriptions are hierarchical, and lend ...

  • Projective Structure from Two Uncalibrated Images: Structure from Motion and RecRecognition 

    Unknown author (1992-09-01)
    This paper addresses the problem of recovering relative structure, in the form of an invariant, referred to as projective structure, from two views of a 3D scene. The invariant structure is computed without any prior ...

  • PrologPF: Parallel Logic and Functions on the Delphi Machine 

    Lewis, Ian (University of CambridgeComputer LaboratoryGirton College, 1998-06-16)
    PrologPF is a parallelising compiler targeting a distributed system of general purpose workstations connected by a relatively low performance network. The source language extends standard Prolog with the integration of ...

  • Promoting Innovation in Africa through Robotics Education 

    Mbanisi, Kenechukwu (2017-07-10)
    NA

  • Proof of a conjecture of Batyrev and Nill 

    Favero, David; Kelly, Tyler Lee (Johns Hopkins University PressAmerican Journal of Mathematics, 2016)
    We prove equivalences of derived categories for the various mirrors in the Batyrev-Borisov construction. In particular, we obtain a positive answer to a conjecture of Batyrev and Nill. The proof involves passing to an ...

  • A Proof-Checker for Dynamic Logic 

    Unknown author (1977-06-01)
    We consider the problem of getting a computer to follow reasoning conducted in dynamic logic. This is a recently developed logic of programs that subsumes most existing first-order logics of programs that manipulate ...

  • The Proofchecker 

    Unknown author (1961-01-01)
    The Proofchecker is a heuristically oriented computer program for checking mathematical proofs, with the checking of textbook proofs as its ultimate goal. It constructs, from each proof step given to it, a corresponding ...

  • Propagation Networks: A Flexible and Expressive Substrate for Computation 

    Unknown author (2009-11-03)
    I propose a shift in the foundations of computation. Practically all ideas of general-purpose computation today are founded either on execution of sequences of atomic instructions, i.e., assembly languages, or on evaluation ...

  • Propagation of Constraints Applied to Circuit Synthesis 

    Unknown author (1978-09-01)
    A major component in the process of design is synthesis, the determination of the parameters of the parts of a network given desiderata for the behavior of the network as a whole. Traditional automated synthesis ...

  • Properties and Applications of Shape Recipes 

    Unknown author (2002-12-01)
    In low-level vision, the representation of scene properties such as shape, albedo, etc., are very high dimensional as they have to describe complicated structures. The approach proposed here is to let the image itself ...

  • Properties of expanding universes 

    Hawking, Stephen (University of CambridgeFaculty of Mathematics. Applied Mathematics and Theoretical Physics, 1966-03-15)
    Some implications and consequences of the expansion of the universe are examined. In Chapter 1 it is shown that this expansion creates grave difficulties for the Hoyle-Narlikar theory of gravitation. Chapter 2 deals with ...

  • Properties of Support Vector Machines 

    Unknown author (1997-08-01)
    Support Vector Machines (SVMs) perform pattern recognition between two point classes by finding a decision surface determined by certain points of the training set, termed Support Vectors (SV). This surface, which in some ...

  • Prophet: Automatic Patch Generation via Learning from Successful Human Patches 

    Unknown author (2015-05-26)
    We present Prophet, a novel patch generation system that learns a probabilistic model over candidate patches from a large code database that contains many past successful human patches. It defines the probabilistic model ...

  • Prophet: Automatic Patch Generation via Learning from Successful Patches 

    Unknown author (2015-07-13)
    We present Prophet, a novel patch generation system that learns a probabilistic model over candidate patches from a database of past successful patches. Prophet defines the probabilistic model as the combination of a ...

  • A Proposal for a Computational Model of Anatomical and Physiological Reasoning 

    Unknown author (1978-11-01)
    The studies of anatomy and physiology are fundamental ingredients of medical education. This paper identifies six ways in which such functional knowledge serves as the underpinnings for general medical reasoning, and ...

  • Proposal for a FAP Language Debugging Program 

    Unknown author (1963-06-01)
    A time-sharing system for the 7090 computer is being developed at the M.I.T. Computation Center whereby many users can communicate simultaneously with the computer through individual consoles. In the time-sharing ...

  • A Proposal for a Geometry Theorem Proving Program 

    Unknown author (1963-09-01)
    During the last half of the nineteenth century the need for formal methods of proof became evident to mathematicians who were making such confidence-shaking discoveries as non-Euclidean geometry. The demand is not to be ...

  • Proposal For a Study of Commonsense Physical Reasoning 

    Unknown author (MIT Artificial Intelligence Laboratory, 1981-07)
    Our common sense views of physics are the first coin in our intellectual capital; understanding precisely what they contain could be very important both for understanding ourselves and for making machines more like us. ...

  • A Proposal For An Intelligent Debugging Assistant 

    Unknown author (MIT Artificial Intelligence Laboratory, 1988-01)
    There are many ways to find bugs in programs. For example, observed input and output values can be compared to predicted values. An execution trace can be examined to locate errors in control flow. The utility of these and ...

  • A Proposal for Research With the Goal of Formulating a Computational Theory of Rational Action 

    Unknown author (MIT Artificial Intelligence Laboratory, 1985-04)
    A theory of rational action can be used to determine the right action to perform in a situation. I will develop a theory of rational action in which an agent has access to an explicit theory of rationality. The agent makes ...