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:

  • The Design of a Relational Engine 
    Torlak, Emina; Jackson, Daniel (2006-09-29)
    The key design challenges in the construction of a SAT-based relational engine are described, and novel techniques are proposed to address them. An efficient engine must have a mechanism for specifying partial solutions, ...
  • The Interval Programming Model for Multi-objective Decision Making 
    Benjamin, Michael R. (2004-09-27)
    The interval programming model (IvP) is a mathematical programmingmodel for representing and solving multi-objective optimizationproblems. The central characteristic of the model is the use ofpiecewise linearly defined ...
  • A Theoretical Analysis of Electrical Properties of Spines 
    Koch, C.; Poggio, T. (1983-04-01)
    The electrical properties of a cortical (spiny) pyramidal cell were analyzed on the basis of passive cable theory from measurements made on histological material (Koch, Poggio & Torre 1982). The basis of this analysis ...
  • Theoretical Analysis of Geographic Routing in Social Networks 
    Kumar, Ravi; Liben-Nowell, David; Novak, Jasmine; Raghavan, Prabhakar; Tomkins, Andrew (2005-06-03)
    We introduce a formal model for geographic social networks, and introduce the notion of rank-based friendship, in which the probability that a person v is a friend of a person u is inversely proportional to the number of ...
  • A Theoretical Analysis of the Electrical Properties of a X-Cell in the Cat's LGN 
    Koch, Christof (1984-03-01)
    Electron microscope studies of relay cells in the lateral geniculate nucleus of the CAT have shown that the retinal input of X-cells is associated with a special synaptic circuitry, termed the spine-triad complex. The ...
  • Theories in Practice: Easy-to-Write Specifications that Catch Bugs 
    Saff, David; Boshernitsan, Marat; Ernst, Michael D. (2008-01-14)
    Automated testing during development helps ensure that software works according to the test suite. Traditional test suites verify a few well-picked scenarios or example inputs. However, such example-based testing does not ...
  • Theories of Comparative Analysis 
    Weld, Daniel S. (1988-05-01)
    Comparative analysis is the problem of predicting how a system will react to perturbations in its parameters, and why. For example, comparative analysis could be asked to explain why the period of an oscillating ...
  • Theories, Pre-Theories and Finite State Transformations on Trees 
    Wand, Mitchell (1971-05-01)
    The closure of an algebra is defined as a generalization of the semigroup of a finite automation. Pretheories are defined as a subclass of the closed algebras, and the relationship between pretheories and the algebraic ...
  • A Theory of Computer Instructions 
    Maurer, Ward Douglas (1965-09-01)
    This paper has arisen from an attempt to determine the nature of computer instructions from a viewpoint of general function and set theory. Mathematical machines, however the term is understood, are not adequate models for ...
  • Theory of Edge Detection 
    Marr, D.; Hildreth, E. (1979-04-01)
    A theory of edge detection is presented.
  • Theory of Handwriting 
    Hollerbach, John (1980-03-01)
    Handwriting production is viewed as a constrained modulation of an underlying oscillatory process. Coupled oscillations in horizontal and vertical directions produce letter forms, and when superimposed on a rightward ...
  • A Theory of How the Brain Might Work 
    Poggio, Tomaso (1990-12-01)
    I wish to propose a quite speculative new version of the grandmother cell theory to explain how the brain, or parts of it, may work. In particular, I discuss how the visual system may learn to recognize 3D objects. The ...
  • A Theory of Human Stereo Vision 
    Marr, D.; Poggio, T. (1977-11-01)
    An algorithm is proposed for solving the stereoscopic matching problem. The algorithm consists of five steps: 1.) Each image is filtered with bar masks of four sizes that vary with eccentricity; the equivalent filters ...
  • A Theory of Networks for Appxoimation and Learning 
    Poggio, Tomaso; Girosi, Federico (1989-07-01)
    Learning an input-output mapping from a set of examples, of the type that many neural networks have been constructed to perform, can be regarded as synthesizing an approximation of a multi-dimensional function, that ...
  • A Theory of Plans for Electronic Circuits 
    de Kleer, Johan (MIT Artificial Intelligence Laboratory, 1977-04)
    A plan for a device assigns purposes to each of the more primitive components and explains how these components interact to achieve the desired behavior of the composite device. Such an information structure is critically ...
  • A Theory of Quantitative Inference Applied to a Mechanical Design Compiler 
    Ward, Allen C. (1989-01-01)
    This thesis presents the ideas underlying a computer program that takes as input a schematic of a mechanical or hydraulic power transmission system, plus specifications and a utility function, and returns catalog numbers ...
  • The Psychophysiology of Risk Processing and Decision Making at a Regional Stock Exchange 
    Perry, John C. (2007-06-12)
    A longstanding controversy in philosophy is whether decision-making isgoverned by reason or emotion. I study the role of physiologicalresponses in the decision-making process within the realm of financialmarkets, where ...
  • The Quorum Deployment Problem 
    Gilbert, Seth; Malewicz, Grzegorz (2004-10-29)
    Quorum systems are commonly used to maintain the consistency of replicated data in adistributed system. Much research has been devoted to developing quorum systems with good theoreticalproperties, such as fault tolerance ...
  • The Satisfiability Threshold of Random 3-SAT Is at Least 3.52 
    Hajiaghayi, MohammadTaghi; Sorkin, Gregory B. (2003-11-20)
    We prove that a random 3-SAT instance with clause-to-variable densityless than 3.52 is satisfiable with high probability.The proof comes through an algorithm which selects (and sets) a variabledepending on its degree and ...
  • The Security Power of the Ballot Box 
    Lepinski, Matt; Izmalkov, Sergei (2005-02-02)
    We show that any function F can be securely evaluated by a protocolwith ballots and a ballot box. That is, N mutually suspicious players,each player possessing a secret input, can use ballots and a ballotbox to jointly ...
MIT-Mirage