Advanced Search
DSpace@MIT

Browsing CSAIL Digital Archive by Title

Research and Teaching Output of the MIT Community

Browsing CSAIL Digital Archive by Title

Sort by: Order: Results:

  • 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 ...
  • 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 ...
  • 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 ...
  • 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 ...
  • Benjamin, Michael R.; Leonard, John J.; Schmidt, Henrik; Newman, Paul M. (2009-06-18)
    This document describes the IvP Helm - an Open Source behavior-based autonomy application for unmanned vehicles. IvP is short for interval programming - a technique for representing and solving multi-objective optimizations ...
  • Benjamin, Michael R.; Newman, Paul; Schmidt, Henrik; Leonard, John J. (2010-08-27)
    This document describes the IvP Helm -- an Open Source behavior-based autonomy application for unmanned vehicles. IvP is short for interval programming -- a technique for representing and solving multi-objective optimizations ...
  • Benjamin, Michael R.; Schmidt, Henrik; Newman, Paul; Leonard, John J. (2011-08-03)
    This document describes the IvP Helm - an Open Source behavior-based autonomy application for unmanned vehicles. IvP is short for interval programming - a technique for representing and solving multi-objective optimizations ...
  • Misailovic, Sasa; Kim, Deokhwan; Rinard, Martin (2010-08-05)
    We present QuickStep, a novel system for parallelizing sequential programs. QuickStep deploys a set of parallelization transformations that together induce a search space of candidate parallel programs. Given a sequential ...
  • Radeva, Tsvetomira; Lynch, Nancy (2011-04-14)
    Partial Reversal (PR) is a link reversal algorithm which ensures that the underlying graph structure is destination-oriented and acyclic. These properties of PR make it useful in routing protocols and algorithms for solving ...
  • Devadas, Srinivas; Agarwal, Anant; Hoffmann, Henry (2009-06-16)
    This work presents four partitioning strategies, or patterns, useful for decomposing a serial application into multiple concurrently executing parts. These partitioning strategies augment the commonly used task and data ...
  • Levin, Anat; Nadler, Boaz; Durand, Fredo; Freeman, William T. (2012-10-07)
    Image restoration tasks are ill-posed problems, typically solved withpriors. Since the optimal prior is the exact unknown density of natural images,actual priors are only approximate and typically restricted to small ...
  • Micali, Silvio; Chen, Jing (2009-12-04)
    We show that, when the players are perfectly informed about each other, essentially all social-choice functions can be rationally robustly implemented via an extensive-form public-action mechanism that (1) is perfectly ...
  • Izmalkov, Sergei; Lepinski, Matt; Micali, Silvio (2005)
    Privacy and trust affect our strategic thinking, yet they have not been precisely modeled in mechanism design. In settings of incomplete information, traditional implementations of a normal-form mechanism ---by disregarding ...
  • Izmalkov, Sergei; Lepinski, Matt; Micali, Silvio (2007-03)
    Privacy and trust affect our strategic thinking, yet they have not been precisely modeled in mechanism design. In settings of incomplete information, traditional implementations of a normal-form mechanism ---by disregarding ...
  • Zeng, Qing; Curtis, Dorothy (2010-02-25)
    Increasingly, natural language processing (NLP) techniques are being developed and utilized in a variety of biomedical domains. Part of speech tagging is a critical step in many NLP applications. Currently, we are developing ...
  • Mukherjee, Sayan; Golland, Polina; Panchenko, Dmitry (2003-08-28)
    We introduce and explore an approach to estimating statisticalsignificance of classification accuracy, which is particularly usefulin scientific applications of machine learning where highdimensionality of the data and the ...
  • Gombolay, Matthew C. (2015-07-02)
    Resource optimization in health care, manufacturing, and military operations requires the careful choreography of people and equipment to effectively fulfill the responsibilities of the profession. However, resource ...
  • Rifkin, Ryan; Bouvrie, Jake; Schutte, Ken; Chikkerur, Sharat; Kouh, Minjoon; Ezzat, Tony; Poggio, Tomaso (2007-02-01)
    A preliminary set of experiments are described in which a biologically-inspired computer vision system (Serre, Wolf et al. 2005; Serre 2006; Serre, Oliva et al. 2006; Serre, Wolf et al. 2006) designed for visual object ...
MIT-Mirage