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:

  • Censor-Hillel, Keren; Gilbert, Seth; Kuhn, Fabian; Lynch, Nancy; Newport, Calvin (2011-12-22)
    In this paper we study the problem of building a connected dominating set with constant degree (CCDS) in the dual graph radio network model. This model includes two types of links: reliable links, which always deliver ...
  • Abelson, Harold; diSessa, Andy (1976-09-01)
    During the summer of 1976, the Massachussetts Institute of Technology Artificial Intelligence Laboratory sponsored a Student Science Training Program in Mathematics, Physics and Computer Science for high ability ...
  • Forbus, Kenneth D. (1981-02-01)
    Reasoning about motion is an important part of our commonsense knowledge, involving fluent spatial reasoning. This work studies the qualitative and geometric knowledge required to reason in a world that consists of ...
  • Hsu, Eugene; Pulli, Kari; Popovic, Jovan (2005-08-01)
    Style translation is the process of transforming an input motion into a new style while preserving its original content. This problem is motivated by the needs of interactive applications, which require rapid processing ...
  • Hsu, Eugene; Pulli, Kari; Popovic, Jovan (2005-08-01)
    Style translation is the process of transforming an input motion into a new style while preserving its original content. This problem is motivated by the needs of interactive applications, which require rapid processing ...
  • Lepinski, Matthew; Micali, Silvio (2005-11-02)
    In their paper, "Rational Secure Computation and Ideal Mechanism Design," Izmalkov, Lepinski and Micali show that any one-shot mediated game can be simulated by the players themselves, without the help of a trusted mediator, ...
  • Brooks, Rodney A.; Lozano-Perez, Tomas (1982-12-01)
    A hierarchical representation for configuration space is presented, along with an algorithm for searching that space for collision-free paths. The detail of the algorithm are presented for polygonal obstacles and a ...
  • McIntosh, Harold V. (1968-01-01)
    SUBM is a CONVERT program, realized in the CTSS LISP of Project MAC, for constructing the subset machine with the same behaviour as a given transition system. The program interactively collects the six items defining a ...
  • Zadimoghaddam, Morteza; Hajiaghayi, MohammadTaghi; Bateni, MohammadHossein (2010-02-01)
    Online auction is an essence of many modern markets, particularly networked markets, in which information about goods, agents, and outcomes is revealed over a period of time, and the agents must make irrevocable decisions ...
  • Poggio, Tomaso; Rosasco, Lorenzo; Wibisono, Andre (2009-12-01)
    In this paper, we study the stability and generalization properties of penalized empirical-risk minimization algorithms. We propose a set of properties of the penalty term that is sufficient to ensure uniform ?-stability: ...
  • Robnett, Richard A. (1963-04-01)
    Below is a list of suggested Conventions and De-bugging aids for LISP time-sharing. Any and all suggestions are encouraged and should be submitted in writing to R. A. Robnett in a hurry.
  • Freuder, Eugene C. (MIT Artificial Intelligence Laboratory, 1973-03)
    Results of scene analysis, as they are achieved, direct and advise the flow of subsequent processing.
  • Drescher, Gary L. (MIT Artificial Intelligence Laboratory, 1980-02)
    This paper presents suggestions for "Genetic A.I.": an attempt to model the genesis of intelligence in human infants, particularly as described by Piaget's theory of the Sensorimotor period. The paper includes a synopsis ...
  • Lee, Michelle Kwok (1989-05-01)
    This report describes a program which automatically characterizes the behavior of any driven, nonlinear, electrical circuit. To do this, the program autonomously selects interesting input parameters, drives the circuit, ...
  • Goldstein, Ira P. (1974-05-01)
    A collection of powerful ideas??cription, plans, linearity, insertions, global knowledge and imperative semantics?? explored which are fundamental to debugging skill. To make these concepts precise, a computer monitor ...
  • Winston, Patrick H. (MIT Artificial Intelligence Laboratory, 1972-07)
    This is an introduction to some of the MIT AI vision work of the last few years. The topics discussed are 1) Waltz's work on line drawing semantics, 2) heterarchy, 3) the ancient learning business and 4) copying scenes. ...
  • Sussman, Gerald Jay; Guzman, Adolfo (1966-07-01)
    no abstract
  • Lamport, Leslie (1966-10-01)
    We assume that we are given a square array that describes a scene. The name of the array will be "array." The number of points representing the side length of the array will be called "pts." (I.e., (pts)2 is the total ...
  • Papert, Seymour (1966-07-01)
    The summer vision project is an attempt to use our summer workers effectively in the construction of a significant part of a visual system. The particular task was chosen partly because it can be segmented into sub-problems ...
  • Stallman, Richard M. (1983-07-01)
    The SUPDUP protocol provides for login to a remote system over a network with terminal-independent output, so that only the local system need know how to handle the user's terminal. It offers facilities for graphics and ...
MIT-Mirage