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:

  • Millonas, Mark M.; Rauch, Erik M. (1999-09-28)
    The Turing mechanism for the production of a broken spatial symmetry in an initially homogeneous system of reacting and diffusing substances has attracted much interest as a potential model for certain aspects of ...
  • Stefanescu, Dan (MIT Artificial Intelligence Laboratory, 1975-07)
  • Weitzner, Daniel J.; Abelson, Harold; Berners-Lee, Tim; Hanson, Chris; Hendler, James; Kagal, Lalana; McGuinness, Deborah L.; Sussman, Gerald Jay; Waterman, K. Krasnow (2006-01-27)
    Attempts to address issues of personal privacy in a world of computerized databases and information networks -- from security technology to data protection regulation to Fourth Amendment law jurisprudence -- typically ...
  • Choi, Myung Jin; Lim, Joseph J.; Torralba, Antonio; Willsky, Alan S. (2010-10-29)
    There has been a growing interest in exploiting contextual information in addition to local features to detect and localize multiple object categories in an image. A context model can rule out some unlikely combinations ...
  • Meila, Marina; Jordan, Michael I. (1997-03-01)
    When triangulating a belief network we aim to obtain a junction tree of minimum state space. Searching for the optimal triangulation can be cast as a search over all the permutations of the network's vaeriables. Our ...
  • McLaughlin, James R. (MIT Artificial Intelligence Laboratory, 1982-06)
    Currently, it is difficult for a non-programmer to generate a complex sensor-based robotic program. Most robot programming methods either generate only very simple programs or are such that they are only useful to programmers. ...
  • Doyle, Jon (1979-06-01)
    To choose their actions, reasoning programs must be able to make assumptions and subsequently revise their beliefs when discoveries contradict these assumptions. The Truth Maintenance System (TMS) is a problem solver ...
  • Doyle, Jon (1978-01-01)
    The thesis developed here is that reasoning programs which take care to record the logical justifications for program beliefs can apply several powerful, but simple, domain-independent algorithms to (1) maintain the ...
  • diSessa, Andy (1975-12-01)
    Since the LOGO Turtle took his first step he has been mathematically confined to running around on flat surfaces. Fortunately the physically intuitive, procedurally oriented nature of the Turtle which makes him a ...
  • 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 ...
MIT-Mirage