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:

  • Azar, Pablo; Micali, Silvio (2012-05-08)
    We study the problem of profit maximization in auctions of one good where the buyers' valuations are drawn from independent distributions. When these distributions are known to the seller, Myerson's optimal auction is a ...
  • Azar, Pablo Daniel; Micali, Silvio (2012-06-14)
    We study the problem of an auctioneer who wants to maximize her profits. In our model, there are n buyers with private valuations drawn from independent distributions F_1,...,F_n. When these distributions are known to the ...
  • Caponnetto, Andrea (2006-09-10)
    We develop some new error bounds for learning algorithms induced by regularization methods in the regression setting. The "hardness" of the problem is characterized in terms of the parameters r and s, the first related ...
  • Geiger, Davi; Poggio, Tomaso (1988-09-01)
    Many problems in early vision are ill posed. Edge detection is a typical example. This paper applies regularization techniques to the problem of edge detection. We derive an optimal filter for edge detection with a ...
  • Sanger, Terence D. (1989-01-01)
    We investigate the properties of feedforward neural networks trained with Hebbian learning algorithms. A new unsupervised algorithm is proposed which produces statistically uncorrelated outputs. The algorithm causes ...
  • Waters, Richard C. (1989-01-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. (1989-01-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 understand ...
  • Kaashoek, Frans; Morris, Robert; Mao, Yandong (2010-05-02)
    MapReduce is a programming model for data-parallel programs originally intended for data centers. MapReduce simplifies parallel programming, hiding synchronization and task management. These properties make it a promising ...
  • Chen, Jing; Micali, Silvio (2012-07-31)
    Shimoji and Watson (1998) prove that a strategy of an extensive game is rationalizable in the sense of Pearce if and only if it survives the maximal elimination of conditionally dominated strategies. Briefly, this process ...
  • Hicks, Jamey; Curtis, Dorothy; Teller, Seth; Charrow, Ben; Ryan, Russell; Ledlie, Jonathan; Battat, Jonathan (2008-12-30)
    We describe an indoor, room-level location discovery method based on spatial variations in "wifi signatures," i.e., MAC addresses and signal strengths of existing wireless access points. The principal novelty of our system ...
  • Nagpal, Radhika (1999-08-29)
    This paper demonstrates that it is possible to generate a reasonably accurate coordinate system on randomly distributed processors, using only local information and local communication. By coordinate systems we imply ...
  • Evans, Isaac; Lynch, Joseph (2013-05-24)
    Organon is an open source system for expressing and solving complex symbolic constraints between generic entities. Our design avoids restricting the programmer s ability to phrase constraints; Organon acts purely as a ...
  • Horn, Berthold K.P. (1975-01-01)
    Will computers that see and understand what they see revolutionize industry by automating the part orientation and part inspection processes? There are two obstacles: the expense of computin and our feeble understanding ...
  • Applegate, James H.; Douglas, Michael R.; Gursel, Yekta; Sussman, Gerald Jay; Wisdom, Jack (1986-02-01)
    We used a special purpose computer to integrate the orbits of the outer five planets for 100 Myr into the future and 100 Myr into the past. The strongest features in the Fourier transforms of the orbital elements of ...
  • McAllester, David A. (1980-08-01)
    Truth maintenance systems have been used in several recent problem solving systems to record justifications for deduced assertions, to track down the assumptions which underlie contradictions when they arise, and to ...
  • Holloway, Jack (1966-08-01)
    The plotter on the console of the PDP-6 is currently attached to device number 774, and accepts stepping pulses given under control of a CONO to that device. Its normal mode of operation is to CONO the desired bits on, ...
  • Perli, Samuel David; Gollakota, Shyamnath; Katabi, Dina (2009-02-18)
    Today, the number of concurrent packets in a MIMO LAN is limited by the number of antennas on the AP. This paper shows how to overcome this limit. It presents a new design where multiple client-AP pairs can communicate ...
  • Carr, Brian P.; Goldstein, Ira P. (1977-02-01)
    Overlay modelling is a technique for describing a student's problem solving skills in terms of modular program designed to be an expert for the given domain. The model is an overlay on the expert program in that it consists ...
  • Miller, Mark L.; Goldstein, Ira P. (1977-02-01)
    SPADE is a theory of the design of computer programs in terms of complementary planning and debugging processes. An overview of the authors' recent research on this theory is provided. SPADE borrows tools from ...
  • Miller, Mark L.; Golstein, Ira P. (1977-02-01)
    The SPADE theory uses linguistic formalisms to model the program planning and debugging processes. The theory has been applied to constructing a grammar-based editor in which programs are written in a structured ...
MIT-Mirage