Advanced Search
DSpace@MIT

Browsing CSAIL Technical Reports (July 1, 2003 - present) by Title

Research and Teaching Output of the MIT Community

Browsing CSAIL Technical Reports (July 1, 2003 - present) by Title

Sort by: Order: Results:

  • Goler, Jonathan A. (2004-05-28)
    The next generations of both biological engineering and computer engineering demand that control be exerted at the molecular level. Creating, characterizing and controlling synthetic biological systems may provide us with ...
  • Beal, Jacob; Sussman, Gerald (2005-01-18)
    Inspired by the robustness and flexibility of biological systems, we are developing linguistic and programming tools to allow us to program spatial systems populated by vast numbers of unreliable components interconnected ...
  • Andoni, Alexandr; Ba, Khanh Do; Indyk, Piotr (2008-05-02)
    e study a natural generalization of the heavy hitters problem in thestreaming context. We term this generalization *block heavy hitters* and define it as follows. We are to stream over a matrix$A$, and report all *rows* ...
  • Kim, Heejung; Wohlwend, Jeremy; Leibo, Joel Z.; Poggio, Tomaso (2013-06-18)
    When learning to recognize a novel body shape, e.g., a panda bear, we are not misled by changes in its pose. A "jumping panda bear" is readily recognized, despite having no prior visual experience with the conjunction of ...
  • Krishna, Tushar; Beckmann, Bradford M.; Peh, Li-Shiuan; Reinhardt, Steven K. (2011-03-14)
    Future many-core chips will require an on-chip network that can support broadcasts and multicasts at good power-performance. A vanilla on-chip network would send multiple unicast packets for each broadcast packet, resulting ...
  • Yokono, Jerry Jun; Poggio, Tomaso (2005-07-07)
    Object recognition systems relying on local descriptors are increasingly used because of their perceived robustness with respect to occlusions and to global geometrical deformations. Descriptors of this type -- based on ...
  • Kandula, Srikanth; Katabi, Dina; Jacob, Matthias; Berger, Arthur (2004-10-22)
    Recent denial of service attacks are mounted by professionalsusing Botnets of tens of thousands of compromisedmachines. To circumvent detection, attackers areincreasingly moving away from pure bandwidth oods toattacks ...
  • Pass, Rafael; Shelat, Abhi; Vaikuntanathan, Vinod (2006-12-14)
    Under an adaptive chosen ciphertext attack (CCA2), the security of an encryption scheme must hold against adversaries that have access to a decryption oracle. We consider a weakening of CCA2 security, wherein security ...
  • Censor-Hillel, Keren; Haeupler, Bernhard; Lynch, Nancy; Medard, Muriel (2012-08-27)
    Efficient communication in wireless networks is typically challenged by the possibility of interference among several transmitting nodes. Much important research has been invested in decreasing the number of collisions in ...
  • Chiesa, Alessandro; Micali, Silvio; Zhu, Zeyuan Allen (2013-12-03)
    We relate the strategies obtained by (1) utility maximizers who use regret to refine their set of undominated strategies, and (2) regret minimizers who use weak domination to refine their sets of regret-minimizing strategies.
  • Oshman, Rotem; Richa, Andrea; Newport, Calvin; Lynch, Nancy; Kuhn, Fabian (2010-06-08)
    Practitioners agree that unreliable links, which fluctuate between working and not working, are an important characteristic of wireless networks. In contrast, most theoretical models of radio networks fix a static set of ...
  • Hearn, Robert A. (2004-06-16)
    Most Artificial Intelligence (AI) work can be characterized as either ``high-level'' (e.g., logical, symbolic) or ``low-level'' (e.g., connectionist networks, behavior-based robotics). Each approach suffers from particular ...
  • Bachrach, Jonathan; Beal, Jacob (2007-03-14)
    Programmability is a major challenge in spatial computing, anaggregate control problem found in domains such as sensor networks,swarm robotics, and modular robotics. We address this challenge witha model of a spatial ...
  • Liskov, Barbara; Rodrigues, Rodrigo (2005-07-21)
    Byzantine quorum systems have been proposed that work properly even when up to f replicas fail arbitrarily.However, these systems are not so successful when confronted with Byzantine faulty clients. This paper presents ...
  • Rodrigues, Rodrigo; Liskov, Barbara (2004-08-13)
    This paper proposes counter-measures that can be deployedas part of a replicated system to reduce the size ofW, and thus reduce the class of attacks to which the system is vulnerable. Obviously it will not be possible to ...
  • Eriksson, Jakob; Balakrishnan, Hari; Madden, Sam (2008-01-17)
    This paper describes the design, implementation, and evaluation of Cabernet, a system to deliver data to and from moving vehicles using open 802.11 (WiFi) access points encountered opportunistically during travel. Network ...
  • Beckmann, Nathan; Sanchez, Daniel (2015-04-09)
    Modern processors use high-performance cache replacement policies that outperform traditional alternatives like least-recently used (LRU). Unfortunately, current cache models use stack distances to predict LRU or its ...
  • Gupta, Anjali; Krohn, Maxwell; Walfish, Michael (2004-05-05)
    The recently developed rateless erasure codes are a near-optimal channel coding technique that guaranteeslow overhead and fast decoding. The underlying theory, and current implementations, of thesecodes assume that a network ...
  • Tan, Godfrey; Guttag, John (2004-11-12)
    Today's access point based wireless LANs (WLANs) are inefficient and unfair. For many traffic loads they provide far less total throughput than they should, and do a poor job allocating what throughput they do deliver. ...
  • Lee, George J. (2007-06-04)
    This thesis presents a new approach to root cause localization and fault diagnosis in the Internet based on a Common Architecture for Probabilistic Reasoning in the Internet (CAPRI) in which distributed, heterogeneous ...
MIT-Mirage