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:

  • Zibin, Yoav; Potanin, Alex; Artzi, Shay; Kiezun, Adam; Ernst, Michael D. (2007-03-16)
    A compiler-checked immutability guarantee provides useful documentation, facilitates reasoning, and enables optimizations. This paper presents Immutability Generic Java (IGJ), a novel language extension that expresses ...
  • Mohan, Anuj (1999-08-11)
    In this paper we present a component based person detection system that is capable of detecting frontal, rear and near side views of people, and partially occluded persons in cluttered scenes. The framework that is ...
  • Monegan, Michael D. (1989-04-01)
    The Object-oriented Reuse Tool (ORT) supports the reuse of object-oriented software by maintaining a library of reusable classes and recording information about their reusability as well as information associated with their ...
  • Freuder, Eugene C. (MIT Artificial Intelligence Laboratory, 1971-02)
  • Nagao, Kanji; Grimson W. Eric L. (1994-02-01)
    In order to recognize an object in an image, we must determine the best transformation from object model to the image. In this paper, we show that for features from coplanar surfaces which undergo linear transformations ...
  • 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 ...
MIT-Mirage