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:

  • Felzenszwalb, Pedro F. (2001-05-01)
    This thesis presents a statistical framework for object recognition. The framework is motivated by the pictorial structure models introduced by Fischler and Elschlager nearly 30 years ago. The basic idea is to model an ...
  • Kinsy, Michel; Wen, Tina; Shim, Keun Sup; Lis, Mieszko; Cho, Myong Hyon; Devadas, Srinivas (2009-03-27)
    Oblivious routing can be implemented on simple router hardware, but network performance suffers when routes become congested. Adaptive routing attempts to avoid hot spots by re-routing flows, but requires more complex ...
  • McAllester, David (1991-12-01)
    It is obvious to anyone familiar with the rules of the game of chess that a king on an empty board can reach every square. It is true, but not obvious, that a knight can reach every square. Why is the first fact obvious ...
  • Poggio, Tomaso; Hurlbert, Anya (1993-12-01)
    This paper sketches a hypothetical cortical architecture for visual 3D object recognition based on a recent computational model. The view-centered scheme relies on modules for learning from examples, such as Hyperbf-like ...
  • Waters, Richard C. (1988-03-01)
    The benefits of programming in a functional style are well known. In particular, algorithms that are expressed as compositions of functions operating on series/vectors/streams of data elements are much easier to ...
  • Waters, Richard C. (1988-03-01)
    The benefits of programming in a functional style are well known. In particular, algorithms that are expressed as compositions of functions operating on series/vectors/streams of data elements are much easier to ...
  • Waters, Richard C. (1987-10-01)
    The benefits of programming in a functional style are well known. In particular, algorithms that are expressed as compositions of functions operating on series/vectors/streams of data elements are much easier to ...
  • Stevens, Kent A. (1976-06-01)
    The paper describes some experiments with a visual agnosia patient who has lost the abillity to perceive subjective contours. The patient's interpretations of simple examples of occlusion indicate that he fails to ...
  • Hewitt, Carl E. (1987-02-01)
    This paper takes a prescriptive stance on how to establish the information-processing foundations for taking action and making decisions in office work from an open system perspective. We propose due process as a ...
  • Gilbert, Seth; Guerraoui, Rachid; Newport, Calvin (2006-04-19)
    How much damage can a malicious tiny device cause in a single-hopwireless network? Imagine two players, Alice and Bob, who want toexchange information. Collin, a malicious adversary, wants to preventthem from communicating. ...
  • Flynn, Anita (1988-12-01)
    The 1989 AI Lab Winter Olympics will take a slightly different twist from previous Olympiads. Although there will still be a dozen or so athletic competitions, the annual talent show finale will now be a display not ...
  • Fan, Rui; Lynch, Nancy (2006-07-23)
    We prove an $\Omega(n \log n)$ lower bound on the number ofnon-busywaiting memory accesses by any deterministic algorithm solving$n$ process mutual exclusion that communicates via shared registers.The cost of the algorithm ...
  • Zhao, Feng (1987-10-01)
    We develop an algorithm that computes the gravitational potentials and forces on N point-masses interacting in three-dimensional space. The algorithm, based on analytical techniques developed by Rokhlin and Greengard, ...
  • Marnette, Bruno; Kuncak, Viktor; Rinard, Martin (2005-08-03)
    Typestate systems ensure many desirable properties of imperativeprograms, including initialization of object fields and correct use ofstateful library interfaces. Abstract sets with cardinalityconstraints naturally ...
  • Caponnetto, Andrea; Poggio, Tomaso; Smale, Steve (2008-04-04)
    In this paper we present a class of algorithms for similarity learning on spaces of images. The general framework that we introduce is motivated by some well-known hierarchical pre-processing architectures for object ...
  • Herskovits, Annette; Binford, Thomas O. (1970-07-01)
    A description is given of how edge erase of prismatic objects appear through a television camera serving as visual input to a computer. Two types of edge-finding predicates are proposed and compared, one linear in intensity, ...
  • Jordan, Michael; Xu, Lei (1995-04-21)
    "Expectation-Maximization'' (EM) algorithm and gradient-based approaches for maximum likelihood learning of finite Gaussian mixtures. We show that the EM step in parameter space is obtained from the gradient via a ...
  • Kuncak, Viktor; Rinard, Martin (2004-11-30)
    An important feature of object-oriented programming languages is the ability todynamically instantiate user-defined container data structures such as lists, trees,and hash tables. Programs implement such data structures ...
  • Stein, Gideon P.; Shashua, Amnon (1997-12-01)
    This paper investigates the linear degeneracies of projective structure estimation from point and line features across three views. We show that the rank of the linear system of equations for recovering the trilinear tensor ...
  • Borg-Graham, Lyle J. (1992-01-01)
    This thesis describes an investigation of retinal directional selectivity. We show intracellular (whole-cell patch) recordings in turtle retina which indicate that this computation occurs prior to the ganglion cell, ...
MIT-Mirage