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:

  • Finlayson, Mark A.; Halverson, Jeffry R.; Corman, Steven R. (MIT CSAIL, 2014-03-22)
    The N2 Corpus (Narrative Networks Corpus) comprises 100 story texts (42,480 words) relevant to Islamist Extremism, drawn from religious stories, online material, and promotional magazines. The corpus has been annotated for ...
  • Siskind, Jeffrey M. (1993-04-01)
    This thesis proposes a computational model of how children may come to learn the meanings of words in their native language. The proposed model is divided into two separate components. One component produces semantic ...
  • Chapman, David (MIT Artificial Intelligence Laboratory, 1983-06)
    AI problem solvers have almost always been given a complete and correct axiomatization of their problem domain and of the operators available to change it. Here I discuss a paradigm for problem solving in which the problem ...
  • Nuth, Peter R. (1993-08-01)
    This thesis introduces the Named-State Register File, a fine-grain, fully-associative register file. The NSF allows fast context switching between concurrent threads as well as efficient sequential program performance. ...
  • Givan, Robert; McAllester, David; Shalaby, Sameer (1991-12-01)
    We have previously argued that the syntactic structure of natural language can be exploited to construct powerful polynomial time inference procedures. This paper supports the earlier arguments by demonstrating that a ...
  • Bobrow, Daniel G. (1964-03-01)
    This paper describes a computer program which accepts and "understands" a comfortable, but restricted set of one natural language, English. Certain difficulties are inherent in this problem of making a machine "understand" ...
  • Bobrow, Daniel G. (1964-09-01)
    The STUDENT problem solving system, programmed in LISP, accepts as input a comfortable but restricted subset of English which can express a wide variety of algebra story problems. STUDENT finds the solution to a large ...
  • McAllester, David; Givan, Robert (1989-10-01)
    We have argued elsewhere that first order inference can be made more efficient by using non-standard syntax for first order logic. In this paper we show how a fragment of English syntax under Montague semantics provides ...
  • Miller, Laurence (1981-10-01)
    This memo reports the results of a case study into how children learn in the absence of explicit teaching. The three subjects, an eight year old, a ten year old and a thirteen year old were observed in both of two ...
  • Bobick, Aaron F. (1987-11-01)
    This thesis addresses the problem of categorizing natural objects. To provide a criteria for categorization we propose that the purpose of a categorization is to support the inference of unobserved properties of objects ...
  • Minsky, Marvin (1981-08-01)
    Imagine a crystalline world of tiny, discrete "cells", each knowing only what its nearest neighbors do. Each volume of space contains only a finite amount of information, because space and time come in discrete units. ...
  • Beal, Jacob (2003-08-11)
    Small failures should only disrupt a small part of a network. One wayto do this is by marking the surrounding area as untrustworthy ---circumscribing the failure. This can be done with a distributedalgorithm using ...
  • Beal, Jacob (2003-08-11)
    Small failures should only disrupt a small part of a network. One way to do this is by marking the surrounding area as untrustworthy --- circumscribing the failure. This can be done with a distributed algorithm using ...
  • Davis, Randall; Smith, Reid G. (1981-05-01)
    We describe the concept of distributed problem solving and define it as the cooperative solution of problems by a decentralized and loosely coupled collection of problem solvers. This approach to problem solving offers ...
  • Katzenelson, Jacob; Unikovski, Aharon (1995-08-01)
    The MOS transistor physical model as described in [3] is presented here as a network model. The goal is to obtain an accurate model, suitable for simulation, free from certain problems reported in the literature [13], and ...
  • Katti, Sachin; Rahul, Hariharan; Hu, Wenjun; Katabi, Dina; Crowcroft, Jon (2006-02-16)
    We propose a new architecture for wireless mesh networks. In addition to forwarding packets, routers mix (i.e., code) packets from different sources to increase the information content of each transmission. We show that ...
  • Feizi, Soheil; Duffy, Ken; Kellis, Manolis; Medard, Muriel (MIT CSAIL, 2014-12-02)
    Several models exist for diffusion of signals across biological, social, or engineered networks. However, the inverse problem of identifying the source of such propagated information appears more difficult even in the ...
  • Girosi, Federico; Poggio, Tomaso (1989-10-01)
    Networks can be considered as approximation schemes. Multilayer networks of the backpropagation type can approximate arbitrarily well continuous functions (Cybenko, 1989; Funahashi, 1989; Stinchcombe and White, 1989). We ...
  • Minsky, Marvin (1963-03-01)
    A number of models developed in work often called "neural-net" research may be of interest to physiologists working on the problem of memory. From this work comes a variety of ideas on how networks of neuron-like elements ...
  • Cohn, David A. (1994-06-01)
    We consider the question "How should one act when the only goal is to learn as much as possible?" Building on the theoretical results of Fedorov [1972] and MacKay [1992], we apply techniques from Optimal Experiment ...
MIT-Mirage