Now showing items 99-118 of 765

    • Best-first Enumeration Based on Bounding Conflicts, and its Application to Large-scale Hybrid Estimation 

      Timmons, Eric; Williams, Brian C. (2018-05-24)
      With the rise of autonomous systems, there is a need for them to have high levels of robustness and safety. This robustness can be achieved through systems that are self-repairing. Underlying this is the ability to diagnose ...
    • Beyond the Bits: Cooperative Packet Recovery Using Physical Layer Information 

      Woo, Grace Rusi; Kheradpour, Pouya; Katabi, Dina (2007-05-29)
      Wireless networks can suffer from high packet loss rates. This paper shows that the loss rate can be significantly reduced by exposing information readily available at the physical layer. We make the physical layer convey ...
    • Big Data Privacy Scenarios 

      Bruce, Elizabeth; Sollins, Karen; Vernon, Mona; Weitzner, Danny (2015-10-01)
      This paper is the first in a series on privacy in Big Data. As an outgrowth of a series of workshops on the topic, the Big Data Privacy Working Group undertook a study of a series of use scenarios to highlight the challenges ...
    • BigBand: GHz-Wide Sensing and Decoding on Commodity Radios 

      Hassanieh, Haitham; Shi, Lixin; Abari, Omid; Hamed, Ezzeldine; Katabi, Dina (2013-05-22)
      The goal of this paper is to make sensing and decoding GHz of spectrum simple, cheap, and low power. Our thesis is simple: if we can build a technology that captures GHz of spectrum using commodity Wi-Fi radios, it will ...
    • BioJADE: A Design and Simulation Tool for Synthetic Biological Systems 

      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 ...
    • Biologically-Inspired Robust Spatial Programming 

      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 ...
    • Block Heavy Hitters 

      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* ...
    • Body-form and body-pose recognition with a hierarchical model of the ventral stream 

      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 ...
    • BOOM: Broadcast Optimizations for On-chip Meshes 

      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 ...
    • Boosting a Biologically Inspired Local Descriptor for Geometry-free Face and Full Multi-view 3D Object Recognition 

      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 ...
    • Botz-4-Sale: Surviving Organized DDoS Attacks that Mimic Flash Crowds 

      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 ...
    • Bounded CCA2-Secure Non-Malleable Encryption 

      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 ...
    • Bounded-Contention Coding for Wireless Networks in the High SNR Regime 

      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 ...
    • Bridging Theory and Practice in Cache Replacement 

      Beckmann, Nathan; Sanchez, Daniel (2015-12-19)
      Much prior work has studied processor cache replacement policies, but a large gap remains between theory and practice. The optimal policy (MIN) requires unobtainable knowledge of the future, and prior theoretically-grounded ...
    • Bridging Utility Maximization and Regret Minimization 

      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.
    • Broadcasting in Unreliable Radio Networks 

      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 ...
    • Building Grounded Abstractions for Artificial Intelligence Programming 

      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 ...
    • Building Spatial Computers 

      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 ...
    • Byzantine Clients Rendered Harmless 

      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 ...
    • Byzantine Fault Tolerance in Long-Lived Systems 

      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 ...