Browsing CSAIL Technical Reports (July 1, 2003  present) by Title
Now showing items 443462 of 765

NearOptimal Distributed Failure Circumscription
(20030811)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
(20060216)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 ... 
Network Infusion to Infer Information Sources in Networks
(MIT CSAIL, 20141202)Several models exist for diffusion of signals across biological, social, or engineered networks. However, the inverse problem of identifying the source of such propagated information appears more difficult even in the ... 
Network Maximal Correlation
(20150921)Identifying nonlinear relationships in large datasets is a daunting task particularly when the form of the nonlinearity is unknown. Here, we introduce Network Maximal Correlation (NMC) as a fundamental measure to capture ... 
Neural Network Models for Zebra Finch Song Production and Reinforcement Learning
(20041109)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
(20041231)Â“WinnertakeallÂ” 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 MirrorSymmetric Object Views
(20101231)Neurons in inferotemporal cortex that respond similarly to many pairs of mirrorsymmetric images  for example, 45 degree and 45 degree views of the same face  have often been reported. The phenomenon seemed to be an ... 
New Algorithms for Load Balancing in PeertoPeer Systems
(20030716)Load balancing is a critical issue for the efficient operation of peertopeer 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
(20040209)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 LSHbased Algorithm for Approximate Nearest Neighbor
(20051104)We present an algorithm for capproximate nearest neighbor problem in a ddimensional 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)
(20081008)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
(20060614)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 ... 
NewAge Cryptography
(20080416)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; ... 
NIRA: A New Internet Routing Architecture
(20041014)The present Internet routing system faces two challengingproblems. First, unlike in the telephone system, Internet users cannotchoose their widearea Internet service providers (ISPs) separatelyfrom their local access ... 
NonEssential Communication in Mobile Applications
(20150504)This paper studies communication patterns in mobile applications. Our analysis shows that 65% of the HTTP, socket, and RPC communication in toppopular Android applications from Google Play have no effect on the userobservable ... 
NonMetrical Navigation Through Visual Path Control
(20080606)We describe a new method for widearea, nonmetrical 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 ... 
Nonlinear Latent Variable Models for Video Sequences
(20050606)Many highdimensional timevarying signals can be modeled as a sequence of noisy nonlinear observations of a lowdimensional dynamical process. Given highdimensional observations and a distribution describing the ... 
Nonparametric Sparsity and Regularization
(20110926)In this work we are interested in the problems of supervised learning and variable selection when the inputoutput 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
(20080819)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
(20070501)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 ...