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:

  • Freuder, Eugene C. (MIT Artificial Intelligence Laboratory, 1973-10)
    A progress report on the work described in Vision Flashes 33 and 43 on recognition of real objects. Emphasis is on the "active" use of knowledge in directing the flow of visual processing.
  • Cohn, David A.; Ghahramani, Zoubin; Jordan, Michael I. (1995-03-21)
    For many types of learners one can compute the statistically 'optimal' way to select data. We review how these techniques have been used with feedforward neural networks. We then show how the same principles may be ...
  • Hillis, William Daniel (1981-04-01)
    The mechanical hand of the future will roll a screw between its fingers and sense, by touch, which end is which. This paper describes a step toward such a manipulator ?? robot finger that is used to recognize small ...
  • Koile, Kimberle; Tollmar, Konrad; Demirdjian, David; Shrobe, Howard; Darrell, Trevor (2003-06-10)
    Location is a primary cue in many context-aware computing systems, and is often represented as a global coordinate, room number, or Euclidean distance various landmarks. A user?s concept of location, however, is often ...
  • Kahn, Kenneth M. (MIT Artificial Intelligence Laboratory, 1976-02)
    This paper reproduces an appendix of a doctoral thesis proposal that describes a language based on actor semantics designed especially for animation. The system described herein is built upon MacLisp and is also compatible ...
  • Agha, Gul Abdulnabi (1985-06-01)
    A foundational model of concurrency is developed in this thesis. We examine issues in the design of parallel systems and show why the actor model is suitable for exploiting large-scale parallelism. Concurrency in actors ...
  • Hewitt, Carl; Baker, Henry (1977-07-01)
    This paper presents precise versions of some "laws" that must be satisfied by computations involving communicating parallel processes. The laws take the form of stating plausible restrictions on the histories of ...
  • Greif, Irene; Hewitt, Carl (MIT Artificial Intelligence Laboratory, 1974-11)
    Work on PLANNER-73 and actors has led to the development of a basis for semantics of programming languages. Its value in describing programs with side-effects, parallelism, and synchronization is discussed. Formal definitions ...
  • Huang, Andrew "bunnie" (2002-06-01)
    The furious pace of Moore's Law is driving computer architecture into a realm where the the speed of light is the dominant factor in system latencies. The number of clock cycles to span a chip are increasing, while the ...
  • Caponnetto, Andrea; Yao, Yuan (2006-09-10)
    We consider learning algorithms induced by regularization methods in the regression setting. We show that previously obtained error bounds for these algorithms using a-priori choices of the regularization parameter, can ...
  • Gardiol, Natalia H.; Kaelbling, Leslie Pack (2008-07-29)
    We describe a method to use structured representations of the environment’s dynamics to constrain and speed up the planning process. Given a problem domain described in a probabilistic logical description language, we ...
  • Rosasco, Lorenzo; Pereverzyev, Sergei; De Vito, Ernesto (2008-10-16)
    The regularization parameter choice is a fundamental problem in supervised learning since the performance of most algorithms crucially depends on the choice of one or more of such parameters. In particular a main theoretical ...
  • White, John L. (1967-07-01)
    In addition to the description on page 13 of AI Memo 116A LAP has the following features: Current Assembly Location Reference, Assembly Time Arithmetic, Constants, Multiple Entry Routines, and Defined Machine Operations ...
  • White, John (1966-08-01)
    Modified LAP: Additions have been made to LAP as described in the PDP-6 write-up.
  • Norton, Lewis Mark (1966-09-01)
    A computer program, named ADEPT (A Distinctly Empirical Prover of Theorems), has been written which proves theorems taken from the abstract theory of groups. Its operation is basically heuristic, incorporating many ...
  • Sullivan, Gregory T. (2002-03-22)
    The Design Patterns book [GOF95] presents 24 time-tested patterns that consistently appear in well-designed software systems. Each pattern is presented with a description of the design problem the pattern addresses, as ...
  • Richards, Whitman; Winston, Patrick Henry; Finlayson, Mark Alan (2009-12-17)
    Report of a Workshop held at the Wylie Center, Beverly, MA, Oct 8-10 2009
  • McDermott, Drew (MIT Artificial Intelligence Laboratory, 1974-05)
    This paper is a reprint of a sketch of an electronic-circuit-designing program, submitted a a Ph.D. proposal. It describes the electronic design problem with respect to the classic trade-off between expertise and generality. ...
  • Liang, Percy; Srebro, Nati (2005-01-03)
    We present a dynamic data structure that keeps track of an acyclic hypergraph (equivalently, a triangulated graph) and enables verifying that adding a candidate hyperedge (clique) will not break the acyclicity of the ...
  • Liskov, Barbara (2012-09-14)
    This document describes the interface that the Aeolus information flow platform provides for users who are implementing applications using Java. The document explains how the Aeolus features are made available by means of ...
MIT-Mirage