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:

  • Wormald, Nicholas; Richards, Whitman (2009-03-30)
    Understanding the dynamics of network evolution rests in part on the representation chosen to characterize the evolutionary process. We offer a simple, three-parameter representation based on subgraphs that capture three ...
  • Grossman, Richard W. (MIT Artificial Intelligence Laboratory, 1975-01)
    The issue of how to represent the "meaning" of an utterance is central to the problem of computer understanding of natural language. Rather than relying on ad-hoc structures or forcing the complexities of natural language ...
  • Marr, D. (1977-05-01)
    Vision is the construction of efficient symbolic descriptions from images of the world. An important aspect of vision is the choice of representations for the different kinds of information in a visual scene. In the ...
  • Reubenstein, Howard (MIT Artificial Intelligence Laboratory, 1986-09)
    The Requirements Analyst's APprentice (RAAP) partially automates the modeling process involved in creating a software requirement. It uses knowledge of the specific domain and general experience regarding software requirements ...
  • Singer, Neil C. (1989-02-01)
    Control of machines that exhibit flexibility becomes important when designers attempt to push the state of the art with faster, lighter machines. Three steps are necessary for the control of a flexible planet. First, ...
  • Micali, Silvio; Chen, Jing (2008-12-17)
    We present various resilient auction mechanisms for a good in limited supply. Our mechanisms achieve both player-knowledge and aggregated player-knowledge benchmarks.
  • Micali, Silvio; Chen, Jing (2008-10-08)
    We put forward a new mechanism achieving a high benchmark for (both revenue and) the sum of revenue and efficiency in truly combinatorial auctions. Notably, our mechanism guarantees its performance (1) in a very adversarial ...
  • Micali, Silvio; Valiant, Paul (2008-11-13)
    Dominant-strategy truthfulness is traditionally considered the best possible solution concept in mechanism design, as it enables one to predict with confidence which strategies INDEPENDENT players will actually choose. ...
  • Jaggi, Sidharth; Langberg, Michael; Katti, Sachin; Ho, Tracy; Katabi, Dina; Medard, Muriel (2006-08-05)
    Network coding substantially increases network throughput. But since it involves mixing of information inside the network, a single corrupted packet generated by a malicious node can end up contaminating all the information ...
  • Chen, Jing; Micali, Silvio (2008-12-02)
    We present two resilient mechanisms: the first for the provision of a public good, and the second for the provision of a private good. Both mechanisms adopt a knowledge-based benchmark.
  • Micali, Silvio; Chen, Jing (2008-12-02)
    We present two resilient mechanisms for the provision of a public good. Both mechanisms adopt a knowledge-based benchmark.
  • Stein, Lynn Andrea (1991-08-01)
    This paper describes a theory of inheritance theories. We present an original theory of inheritance in nonmonotonic hierarchies. The structures on which this theory is based delineate a framework that subsumes most ...
  • Gaschnig, John (MIT Artificial Intelligence Laboratory, 1971-07)
    The eye-hand robot at the Artificial Intelligence Laboratory now possesses the ability to occasionally copy simple configurations of blocks, using spare parts about whose presence it knows. One problem with which it cannot ...
  • Isbell, Charles; Viola, Paul (1998-05-01)
    The task in text retrieval is to find the subset of a collection of documents relevant to a user's information request, usually expressed as a set of words. Classically, documents and queries are represented as vectors ...
  • Micali, Silvio; Valiant, Paul (2007- 11-0)
    Little is known about generating revenue in UNRESTRICTED combinatorial auctions. (In particular, the VCG mechanism has no revenue guarantees.) In this paper we determine how much revenue can be guaranteed in such auctions. ...
  • Brock, David L. (1991-11-01)
    An artificial muscle with strength and speed equal to that of a human muscle may soon be possible. Polymer gels exhibit abrubt volume changes in response to variations in their external conditions -- shrinking or ...
  • Ankcorn, John; Horn, Berthold K.P.; Winston, Patrick H. (MIT Artificial Intelligence Laboratory, 1973-03-20)
    This note is a collection of well known interesting facts about human vision. All parameters are approximate. Some may be wrong. There are sections on retina physiology, eye optics, light adaptation, psychological curios, ...
  • Steele, Guy Lewis, Jr.; Sussman, Gerald Jay (1978-01-01)
    SCHEME is a dialect of LISP. It is an expression-oriented, applicative order, interpreter-based language which allows one to manipulate programs as data. It differs from most current dialects of LISP in that it closes ...
  • Clinger, William; Rees, Jonathan (1991-11-01)
    Data and procedures and the values they amass, Higher-order functions to combine and mix and match, Objects with their local state, the message they pass, A property, a package, the control of point for a catch- In the ...
  • Rees, Jonathan; Clinger, William (1986-09-01)
    Data and procedures and the values they amass, Higher-order functions to combine and mix and match, Objects with their local state, the message they pass, A property, a package, the control of point for a catch- In the ...
MIT-Mirage