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; Rakhlin, Alexander (2005-05-17)
    We study properties of algorithms which minimize (or almost minimize) empirical error over a Donsker class of functions. We show that the L2-diameter of the set of almost-minimizers is converging to zero in probability. ...
  • Long, Fan; Sidiroglou-Douskos, Stelios; Kim, Deokhwan; Rinard, Martin (2013-08-06)
    We present a system, SIFT, for generating input filters that nullify integer overflow errors associated with critical program sites such as memory allocation or block copy sites. SIFT uses a static program analysis to ...
  • Finlayson, Mark Alan; Kulkarni, Nidhi (2011-05-09)
    Contains the source code and data necessary to run all computations described in the following two papers: Finlayson, Mark A. and Kulkarni, Nidhi (2011) "Detecting Multi-Word Expressions improves Word Sense Disambiguation", ...
  • Berinde, Radu; Indyk, Piotr (2008-01-10)
    We consider the approximate sparse recovery problem, where the goal is to (approximately) recover a high-dimensional vector x from its lower-dimensional sketch Ax. A popular way of performing this recovery is by finding ...
  • Theocharous, Georgios; Mahadevan, Sridhar; Kaelbling, Leslie Pack (2005-09-27)
    Partially observable Markov decision processes (POMDPs) are a well studied paradigm for programming autonomous robots, where the robot sequentially chooses actions to achieve long term goals efficiently. Unfortunately, ...
  • Feizi, Soheil; Quon, Gerald; Medard, Muriel; Kellis, Manolis; Jadbabaie, Ali (2015-02-18)
    Network alignment refers to the problem of finding a bijective mapping across vertices of two or more graphs to maximize the number of overlapping edges and/or to minimize the number of mismatched interactions across ...
  • Feamster, Nick; Johari, Ramesh; Balakrishnan, Hari (2005-02-08)
    Thousands of competing autonomous systems (ASes) mustcooperate with each other to provide global Internet connectivity.These ASes encode various economic, business,and performance decisions in their routing policies. The ...
  • Long, Fan; Rinard, Martin (2015-03-11)
    We present SPR, a new program repair system that uses condition synthesis to instantiate transformation schemas to repair program defects. SPR s staged repair strategy combines a rich space of potential repairs with a ...
  • Long, Fan; Rinard, Martin (2015-03-05)
    We present SPR, a new program repair system that uses condition synthesis to instantiate transformation schemas to repair program defects. SPR's staged repair strategy combines a rich space of potential repairs with a ...
  • Hansen, Richard E. (2007-06-21)
    Distributed denial-of-service (DDoS) attacks can easily cripple victim hosts or networks, yet effective defenses remain elusive. Normal anycast can be used to force the diffusion of attack traffic over a group of several ...
  • Nikolova, Evdokia (2008-09-13)
    We consider general combinatorial optimization problems that can be formulated as minimizing the weight of a feasible solution wT x over an arbitrary feasible set. For these problems we describe a broad class of corresponding ...
  • Tenenbaum, Joshua B.; Jonas, Eric M.; Mansinghka, Vikash K. (2008-11-24)
    We introduce combinational stochastic logic, an abstraction that generalizes deterministic digital circuit design (based on Boolean logic gates) to the probabilistic setting. We show how this logic can be combined with ...
  • Censor-Hillel, Keren; Gilbert, Seth; Kuhn, Fabian; Lynch, Nancy; Newport, Calvin (2011-12-22)
    In this paper we study the problem of building a connected dominating set with constant degree (CCDS) in the dual graph radio network model. This model includes two types of links: reliable links, which always deliver ...
  • Hsu, Eugene; Pulli, Kari; Popovic, Jovan (2005-08-01)
    Style translation is the process of transforming an input motion into a new style while preserving its original content. This problem is motivated by the needs of interactive applications, which require rapid processing ...
  • Hsu, Eugene; Pulli, Kari; Popovic, Jovan (2005-08-01)
    Style translation is the process of transforming an input motion into a new style while preserving its original content. This problem is motivated by the needs of interactive applications, which require rapid processing ...
  • Lepinski, Matthew; Micali, Silvio (2005-11-02)
    In their paper, "Rational Secure Computation and Ideal Mechanism Design," Izmalkov, Lepinski and Micali show that any one-shot mediated game can be simulated by the players themselves, without the help of a trusted mediator, ...
  • Zadimoghaddam, Morteza; Hajiaghayi, MohammadTaghi; Bateni, MohammadHossein (2010-02-01)
    Online auction is an essence of many modern markets, particularly networked markets, in which information about goods, agents, and outcomes is revealed over a period of time, and the agents must make irrevocable decisions ...
  • Poggio, Tomaso; Rosasco, Lorenzo; Wibisono, Andre (2009-12-01)
    In this paper, we study the stability and generalization properties of penalized empirical-risk minimization algorithms. We propose a set of properties of the penalty term that is sufficient to ensure uniform ?-stability: ...
  • Borchardt, Gary C. (2015-03-30)
    This report presents a set of software techniques that support the tasks of event recognition, summarization of event sequences, explanation of recognized events, explanation of non-recognized events, prediction of event ...
  • Finlayson, Mark Alan (2014-12-30)
    This archive contains supplementary materials for the article titled "A Survey of Corpora in Computational and Cognitive Narrative Science" by Mark A. Finlayson, published in the journal *Sprache und Datenverarbeitung*. ...
MIT-Mirage