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:

  • Cabernet: A Content Delivery Network for Moving Vehicles 
    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 ...
  • Can Basic ML Techniques Illuminate Rateless Erasure Codes? 
    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 ...
  • Capacity Allocation in Wireless LANs 
    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. ...
  • CAPRI: A Common Architecture for Distributed Probabilistic Internet Fault Diagnosis 
    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 ...
  • Cascading Regularized Classifiers 
    Perez-Breva, Luis (2004-04-21)
    Among the various methods to combine classifiers, Boosting was originally thought as an stratagem to cascade pairs of classifiers through their disagreement. I recover the same idea from the work of Niyogi et al. to show ...
  • The Case for a Factored Operating System (fos) 
    Agarwal, Anant; Wentzlaff, David (2008-10-08)
    The next decade will afford us computer chips with 1,000 - 10,000 cores on a single piece of silicon. Contemporary operating systems have been designed to operate on a single core or small number of cores and hence are not ...
  • A Case for Fine-Grain Adaptive Cache Coherence 
    Kurian, George; Khan, Omer; Devadas, Srinivas (2012-05-22)
    As transistor density continues to grow geometrically, processor manufacturers are already able to place a hundred cores on a chip (e.g., Tilera TILE-Gx 100), with massive multicore chips on the horizon. Programmers now ...
  • CG2Real: Improving the Realism of Computer Generated Images using a Large Collection of Photographs 
    Pfister, Hanspeter; Freeman, William T.; Avidan, Shai; Dale, Kevin; Johnson, Micah K.; Matusik, Wojciech (2009-07-15)
    Computer Graphics (CG) has achieved a high level of realism, producing strikingly vivid images. This realism, however, comes at the cost of long and often expensive manual modeling, and most often humans can still distinguish ...
  • Characteristics of Small Social Networks 
    Richards, Whitman; Macindoe, Owen (2010-07-27)
    Two dozen networks are analyzed using three parameters that attempt to capture important properties of social networks: leadership L, member bonding B, and diversity of expertise D. The first two of these parameters have ...
  • ChitChat: Making Video Chat Robust to Packet Loss 
    Wang, Jue; Katabi, Dina (2010-07-05)
    Video chat is increasingly popular among Internet users. Often, however, chatting sessions suffer from packet loss, which causes video outage and poor quality. Existing solutions however are unsatisfying. Retransmissions ...
  • CNS: a GPU-based framework for simulating cortically-organized networks 
    Poggio, Tomaso; Knoblich, Ulf; Mutch, Jim (2010-02-26)
    Computational models whose organization is inspired by the cortex are increasing in both number and popularity. Current instances of such models include convolutional networks, HMAX, Hierarchical Temporal Memory, and deep ...
  • Co-Clustering with Generative Models 
    Golland, Polina; Lashkari, Danial (2009-11-03)
    In this paper, we present a generative model for co-clustering and develop algorithms based on the mean field approximation for the corresponding modeling problem. These algorithms can be viewed as generalizations of the ...
  • Cognitive-Developmental Learning for a Humanoid Robot: A Caregiver's Gift 
    Arsenio, Artur Miguel (2004-09-26)
    The goal of this work is to build a cognitive system for the humanoid robot, Cog, that exploits human caregivers as catalysts to perceive and learn about actions, objects, scenes, people, and the robot itself. This thesis ...
  • Cognitive Security for Personal Devices 
    Greenstadt, Rachel; Beal, Jacob (2008-03-17)
    Humans should be able to think of computers as extensions of their body, as craftsmen do with their tools. Current security models, however, are too unlike those used in human minds---for example, computers authenticate ...
  • CogSci to AI: It's the Brainware, Stupid! 
    Beal, Jacob; Sussman, Gerald (2006-03)
    Current modularization techniques fail when applied to hard AI problems.But cognitive science shows that the mind has modules specialized for particular functions.Unlike current engineered modules, the modules of themind ...
  • Coherent Reaction 
    Edwards, Jonathan (2009-06-12)
    Side effects are both the essence and bane of imperative programming. The programmer must carefully coordinate actions to manage their side effects upon each other. Such coordination is complex, error-prone, and fragile. ...
  • Collective Choice with Uncertain Domain Moldels 
    Richards, Whitman (2005-08-16)
    When groups of individuals make choices among several alternatives, the most compelling social outcome is the Condorcet winner, namely the alternative beating all others in a pair-wise contest. Obviously the Condorcet ...
  • Collusion-Resilient Revenue In Combinatorial Auctions 
    Valiant, Paul; Micali, Silvio (2007-11-02)
    In auctions of a single good, the second-price mechanism achieves, in dominantstrategies, a revenue benchmark that is naturally high and resilient to anypossible collusion.We show how to achieve, to the maximum extent ...
  • Collusive Dominant-Strategy Truthfulness 
    Chen, Jinc; Micali, Silvio (2011-04-22)
    Fifty years ago, Vickrey published his famous mechanism for auctioning a single good in limited supply. The main property of Vickrey's mechanism is efficiency in dominant strategies. In absence of collusion, this is a ...
  • Combined static and dynamic mutability analysis 
    Artzi, Shay; Ernst, Michael D.; Glasser, David; Kiezun, Adam (2006-09-17)
    Knowing which method parameters may be mutated during a method'sexecution is useful for many software engineering tasks. We presentan approach to discovering parameter immutability, in which severallightweight, scalable ...
MIT-Mirage