Advanced Search
DSpace@MIT

Browsing Computer Science and Artificial Intelligence Lab (CSAIL) by Title

Research and Teaching Output of the MIT Community

Browsing Computer Science and Artificial Intelligence Lab (CSAIL) by Title

Sort by: Order: Results:

  • Hildreth, Ellen C.; Ando, Hiroshi; Anderson, Richard; Treue, Stefan (1991-12-01)
    We address the computational role that the construction of a complete surface representation may play in the recovery of 3--D structure from motion. We present a model that combines a feature--based structure--from- ...
  • Marill, Thomas (1998-03-01)
    Any three-dimensional wire-frame object constructed out of parallelograms can be recovered from a single perspective two-dimensional image. A procedure for performing the recovery is given.
  • Kim, Sunghun; Artzi, Shay; Ernst, Michael D. (2007-11-20)
    It is difficult to fix a problem without being able to reproduce it.However, reproducing a problem is often difficult and time-consuming.This paper proposes a novel algorithm, ReCrash, that generatesmultiple unit tests ...
  • McCarthy, J. (1959-03-30)
    This memorandum is a continuation of Memo 8.
  • McCarthy, J. (1959-03-13)
    The attached paper is a description of the LISP system starting with the machine-independent system of recursive functions of symbolic expressions. This seems to be a better point of view for looking at the system than the ...
  • Hollerbach, John M. (1980-06-01)
    An efficient Lagrangian formulation of manipulator dynamics has been developed. The efficiency derives from recurrence relations for the velocities, accelerations, and generalized forces. The number of additions and ...
  • Sollins, Karen R. (2002-03-01)
    Naming is a central element of a distributed or network system design. Appropriate design choices are central. This paper explores a taxonomy of naming systems, and engineering tradeoffs as an aid to the namespace designer. ...
  • Rahimi, A.; Morency, L.-P.; Darrell, T. (2001-05-07)
    We develop a class of differential motion trackers that automatically stabilize when in finite domains. Most differ-ential trackers compute motion only relative to one previous frame, accumulating errors indefinitely. We ...
  • Hollerbach, John M.; Suh, Ki C. (1986-01-01)
    Methods for resolving kinematic redundancies of manipulators by the effect on joint torque are examined. When the generalized inverse is formulated in terms of accelerations and incorporated into the dynamics, the ...
  • Flynn, Anita M. (1985-09-01)
    Redundant sensors are needed on a mobile robot so that the accuracy with which it perceives its surroundings can be increased. Sonar and infrared sensors are used here in tandem, each compensating for deficiencies in ...
  • Abadi, Daniel J.; Madden, Samuel R. (2004-03-22)
    This paper presents an algorithm for handling many types of filters insensor networks that cannot be expressed using a simple predicate.Specifically, the action of the filter may be predicated on sensor produceddata where ...
  • McIntosh, Harold V. (1968-01-01)
    REEX is a CONVERT program, realized in the CTSS-LISP of Project Mac, for carrying out the McNaughton-Yamada analysis algorithm, whereby a regular expression is found describing the words accepted by a finite state machine ...
  • Kiezun, Adam; Ernst, Michael D.; Tip, Frank; Fuhrer, Robert M. (2006-09-05)
    Type safety and expressiveness of many existing Java libraries and theirclient applications would improve, if the libraries were upgraded to definegeneric classes. Efficient and accurate tools exist to assist clientapplications ...
  • Ernst, Michael D.; Marrero, John; Dig, Danny (2008-09-30)
    Parallelizing existing sequential programs to run efficiently on multicores is hard. The Java 5 packagejava.util.concurrent (j.u.c.) supports writing concurrent programs: much of the complexity of writing threads-safe and ...
  • Woodham, Robert J. (1978-06-01)
    This report explores the relation between image intensity and object shape. It is shown that image intensity is related to surface orientation and that a variation in image intensity is related to surface curvature. ...
  • Clemens, David T. (1991-06-01)
    In model-based vision, there are a huge number of possible ways to match model features to image features. In addition to model shape constraints, there are important match-independent constraints that can efficiently ...
  • Mroueh, Youssef; Poggio, Tomaso; Rosasco, Lorenzo (2011-06-03)
    In this work we discuss a regularization framework to solve multi-category when the classes are described by an underlying class taxonomy. In particular we discuss how to learn the class taxonomy while learning a multi-category ...
  • Verri, Alessandro; Poggio, Tomaso (1986-09-01)
    Many problems of early vision are ill-posed; to recover unique stable solutions regularization techniques can be used. These techniques lead to meaningful results, provided that solutions belong to suitable compact ...
  • Wolf, Lior; Martin, Ian (2004-11-12)
    In this paper, we present and analyze a novel regularization technique based on enhancing our dataset with corrupted copies of the original data. The motivation is that since the learning algorithm lacks information about ...
  • Poggio, Tomaso; Voorhees, Harry; Yuille, Alan (1985-04-01)
    We consider edge detection as the problem of measuring and localizing changes of light intensity in the image. As discussed by Torre and Poggio (1984), edge detection, when defined in this way, is an ill-posed problem ...
MIT-Mirage