Now showing items 441-460 of 763

    • A Natural Language Interface for Mobile Devices 

      Katz, Boris; Borchardt, Gary; Felshin, Sue; Mora, Federico (2018-03-01)
      Creating a robust, automated capability to respond to natural language requests has been a longstanding goal in the development of intelligent systems. This article describes the StartMobile system, originally developed ...
    • 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 ...
    • Network Infusion to Infer Information Sources in Networks 

      Feizi, Soheil; Duffy, Ken; Kellis, Manolis; Medard, Muriel (MIT CSAIL, 2014-12-02)
      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 

      Feizi, Soheil; Makhdoumi, Ali; Duffy, Ken; Kellis, Manolis; Medard, Muriel (2015-09-21)
      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 

      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 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 ...
    • 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; ...
    • 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 ...
    • Non-Essential Communication in Mobile Applications 

      Rubin, Julia; Gordon, Michael I.; Nguyen, Nguyen; Rinard, Martin (2015-05-04)
      This paper studies communication patterns in mobile applications. Our analysis shows that 65% of the HTTP, socket, and RPC communication in top-popular Android applications from Google Play have no effect on the user-observable ...
    • 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 ...
    • 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 ...
    • 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 ...