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:

  • Lieberman, Henry (1976-06-01)
    Until recently, most computer graphics systems have been oriented toward the display of line drawins, continually refreshing the screen from a display list of vectors. Developments such as plasma panel displays and ...
  • Papert, Seymour; Solomon, Cynthia (1971-06-01)
    When people talk about computers in education they do not all have the same image in mind. Some think of using the computer to program the kid; others think of using the kid to program the computer. But most of them have ...
  • Flynn, Anita M.; Brooks, Rodney A.; Tavrow, Lee S. (1989-07-01)
    We want to build tiny gnat-sized robots, a millimeter or two in diameter. They will be cheap, disposable, totally self-contained autonomous agents able to do useful things in the world. This paper consists of two parts. ...
  • Schroeppel, Rich (1972-05-01)
    This note proves that a two counter machine cannot calculate 2N.
  • Finin, Tim (MIT Artificial Intelligence Laboratory, 1971-06)
    This paper is based on a B.S. thesis supervised by Patrick Winston. It deals with some previously unexplored problems in the analysis of visual scenes. The scenes consist of two dimensional line drawings of simple objects ...
  • Woodham, Robert J. (MIT Artificial Intelligence Laboratory, 1976-08)
    Two simple algorithms are described for displaying orthographic projections of surfaces. The first, called RELIEF-PLOT, produces a three-dimensional plot of a surface z = f(x,y). The second, called SHADED-IMAGE, adds ...
  • Ono, Masahiro; Williams, Brian C. (2008-03-06)
    When controlling dynamic systems such as mobile robots in uncertain environments, there is a trade off between risk and reward. For example, a race car can turn a corner faster by taking a more challenging path. This paper ...
  • Arkoudas, Konstantine (2001-10-05)
    This paper introduces Denotational Proof Languages (DPLs). DPLs are languages for presenting, discovering, and checking formal proofs. In particular, in this paper we discus type-alpha DPLs---a simple class of DPLs for ...
  • Arkoudas, Konstantine (2001-10-16)
    Type-omega DPLs (Denotational Proof Languages) are languages for proof presentation and search that offer strong soundness guarantees. LCF-type systems such as HOL offer similar guarantees, but their soundness relies heavily ...
  • Haase, Kenneth W., Jr. (1987-08-01)
    TYPICAL is a package for describing and making automatic inferences about a broad class of SCHEME predicate functions. These functions, called types following popular usage, delineate classes of primitive SCHEME ...
  • Zhao, Qin; Rabbah, Rodric; Amarasinghe, Saman; Rudolph, Larry; Wong, Weng-Fai (2006-09-25)
    Modern memory systems play a critical role in the performance ofapplications, but a detailed understanding of the application behaviorin the memory system is not trivial to attain. It requires timeconsuming simulations of ...
  • Hervas, Raquel; Finlayson, Mark Alan (2010-05-12)
    This version of the UMIREC corpus has been superseded by version 1.1, found at http://hdl.handle.net/1721.1/57507. Please do not use version 1.0, as it contains corrupted coreference information. The correct, uncorrupted ...
  • Finlayson, Mark Alan; Hervas, Raquel (2010-05-12)
    The corpus comprises 62 files in "Story Workbench" annotation format: 30 folktales in English from a variety of sources, and 32 Wall Street Journal articles selected to coincide with articles found in the Penn Treebank. ...
  • Hung, Chou; Kreiman, Gabriel; Poggio, Tomaso; DiCarlo, James J. (2005-07-06)
    Understanding the complex brain computations leading to object recognition requires quantitatively characterizing the information represented in inferior temporal cortex (IT), the highest stage of the primate visual stream. ...
  • Jacobs, D.W.; Alter, T.D. (1995-02-01)
    Building robust recognition systems requires a careful understanding of the effects of error in sensed features. Error in these image features results in a region of uncertainty in the possible image location of each ...
  • Freeman, William; Durand, Fredo; Weiss, Yair; Levin, Anat (2009-03-31)
    Blind deconvolution is the recovery of a sharp version of a blurred image when the blur kernel is unknown. Recent algorithms have afforded dramatic progress, yet many aspects of the problem remain challenging and hard to ...
  • Tuttle, Timothy D. (1992-05-01)
    In my research, I have performed an extensive experimental investigation of harmonic-drive properties such as stiffness, friction, and kinematic error. From my experimental results, I have found that these properties ...
  • Miller, Rob; Karger, David; Marcus, Adam; Bernstein, Michael (2009-10-07)
    To find interesting, personally relevant web content, we often rely on friends and colleagues to pass links along as they encounter them. In this paper, we study and augment link-sharing via e-mail, the most popular means ...
  • Eppinger, Steven D.; Seering, Warren P. (1987-08-01)
    This paper provides an analytical overview of the dynamics involved in force control. Models are developed which demonstrate, for the one-axis explicit force control case, the effects on system closed-loop bandwidth ...
  • Levin, Anat; Freeman, William T.; Durand, Fredo (2008-04-16)
    Computer vision has traditionally focused on extracting structure,such as depth, from images acquired using thin-lens or pinhole optics. The development of computational imaging is broadening this scope; a variety of ...
MIT-Mirage