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:

  • Near-Optimal Distributed Failure Circumscription 
    Beal, Jacob (2003-08-11)
    Small failures should only disrupt a small part of a network. One wayto do this is by marking the surrounding area as untrustworthy ---circumscribing the failure. This can be done with a distributedalgorithm using ...
  • Network Coding Made Practical 
    Katti, Sachin; Rahul, Hariharan; Hu, Wenjun; Katabi, Dina; Crowcroft, Jon (2006-02-16)
    We propose a new architecture for wireless mesh networks. In addition to forwarding packets, routers mix (i.e., code) packets from different sources to increase the information content of each transmission. We show that ...
  • Neural Network Models for Zebra Finch Song Production and Reinforcement Learning 
    Werfel, Justin (2004-11-09)
    The zebra finch is a standard experimental system for studying learning and generation of temporally extended motor patterns. The first part of this project concerned the evaluation of simple models for the operation and ...
  • Neural Voting Machines 
    Richards, Whitman; Seung, H. Sebastian (2004-12-31)
    “Winner-take-all” networks typically pick as winners that alternative with the largest excitatory input. This choice is far from optimal when there is uncertainty in the strength of the inputs, and when information is ...
  • Neurons That Confuse Mirror-Symmetric Object Views 
    Mutch, Jim; Leibo, Joel Z; Smale, Steve; Rosasco, Lorenzo; Poggio, Tomaso (2010-12-31)
    Neurons in inferotemporal cortex that respond similarly to many pairs of mirror-symmetric images -- for example, 45 degree and -45 degree views of the same face -- have often been reported. The phenomenon seemed to be an ...
  • New-Age Cryptography 
    Pass, Rafael; Vaikuntanathan, Vinod (2008-04-16)
    We introduce new and general complexity theoretic hardness assumptions. These assumptions abstract out concrete properties of a random oracle and are significantly stronger than traditional cryptographic hardness assumptions; ...
  • New Algorithms for Load Balancing in Peer-to-Peer Systems 
    Karger, David; Ruhl, Matthias (2003-07-16)
    Load balancing is a critical issue for the efficient operation of peer-to-peer networks. We give new protocols for several scenarios, whose provable performance guarantees are within a constant factor of optimal. First, ...
  • New Architectural Models for Visibly Controllable Computing: The Relevance of Dynamic Object Oriented Architecturesand Plan Based Computing Models 
    Shrobe, Howard; Laddaga, Robert (2004-02-09)
    Traditionally, we've focussed on the question of how to make a system easy to code the first time, or perhaps on how to ease the system's continued evolution. But if we look at life cycle costs, then we must conclude that ...
  • New LSH-based Algorithm for Approximate Nearest Neighbor 
    Andoni, Alexandr; Indyk, Piotr (2005-11-04)
    We present an algorithm for c-approximate nearest neighbor problem in a d-dimensional Euclidean space, achieving query time ofO(dn^{1/c^2+o(1)}) and space O(dn + n^{1+1/c^2+o(1)}).
  • New Resiliency in Truly Combinatorial Auctions (and Implementation in Surviving Strategies) 
    Chen, Jing; Micali, Silvio (2008-10-08)
    Following Micali and Valiant [MV07.a], a mechanism is resilient if it achieves its objective without any problem of (1) equilibrium selection and (2) player collusion. To advance resilient mechanism design,We put forward ...
  • New Techniques for Geographic Routing 
    Leong, Ben (2006-06-14)
    As wireless sensor networks continue to grow in size, we are facedwith the prospect of emerging wireless networks with hundreds orthousands of nodes. Geographic routing algorithms are a promisingalternative to tradition ...
  • NIRA: A New Internet Routing Architecture 
    Yang, Xiaowei (2004-10-14)
    The present Internet routing system faces two challengingproblems. First, unlike in the telephone system, Internet users cannotchoose their wide-area Internet service providers (ISPs) separatelyfrom their local access ...
  • Nonlinear Latent Variable Models for Video Sequences 
    rahimi, ali; recht, ben; darrell, trevor (2005-06-06)
    Many high-dimensional time-varying signals can be modeled as a sequence of noisy nonlinear observations of a low-dimensional dynamical process. Given high-dimensional observations and a distribution describing the ...
  • Non-Metrical Navigation Through Visual Path Control 
    Huang, Albert S.; Teller, Seth (2008-06-06)
    We describe a new method for wide-area, non-metrical robot navigationwhich enables useful, purposeful motion indoors. Our method has twophases: a training phase, in which a human user directs a wheeledrobot with an attached ...
  • Nonparametric Sparsity and Regularization 
    Mosci, Sofia; Rosasco, Lorenzo; Santoro, Matteo; Verri, Alessandro; Villa, Silvia (2011-09-26)
    In this work we are interested in the problems of supervised learning and variable selection when the input-output dependence is described by a nonlinear function depending on a few variables. Our goal is to consider a ...
  • A Note on Perturbation Results for Learning Empirical Operators 
    De Vito, Ernesto; Belkin, Mikhail; Rosasco, Lorenzo (2008-08-19)
    A large number of learning algorithms, for example, spectral clustering, kernel Principal Components Analysis and many manifold methods are based on estimating eigenvalues and eigenfunctions of operators defined by a ...
  • Notes on Regularized Least Squares 
    Rifkin, Ryan M.; Lippert, Ross A. (2007-05-01)
    This is a collection of information about regularized least squares (RLS). The facts here are not “new results”, but we have not seen them usefully collected together before. A key goal of this work is to demonstrate that ...
  • Notes on the Shannon Entropy of the Neural Response 
    Shakhnarovich, Greg; Bouvrie, Jake; Rosasco, Lorenzo; Smale, Steve (2009-10-09)
    In these notes we focus on the concept of Shannon entropy in an attempt to provide a systematic way of assessing the discrimination properties of the neural response, and quantifying the role played by the number of layers ...
  • Object and Reference Immutability using Java Generics 
    Zibin, Yoav; Potanin, Alex; Artzi, Shay; Kiezun, Adam; Ernst, Michael D. (2007-03-16)
    A compiler-checked immutability guarantee provides useful documentation, facilitates reasoning, and enables optimizations. This paper presents Immutability Generic Java (IGJ), a novel language extension that expresses ...
  • Oblivious Routing in On-Chip Bandwidth-Adaptive Networks 
    Kinsy, Michel; Wen, Tina; Shim, Keun Sup; Lis, Mieszko; Cho, Myong Hyon; Devadas, Srinivas (2009-03-27)
    Oblivious routing can be implemented on simple router hardware, but network performance suffers when routes become congested. Adaptive routing attempts to avoid hot spots by re-routing flows, but requires more complex ...
MIT-Mirage