Browsing CSAIL Digital Archive by Title
Now showing items 479-498 of 806
-
Non-Essential Communication in Mobile Applications
(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
(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
(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
(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
(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
(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
(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 ... -
Nuggeteer: Automatic Nugget-Based Evaluation Using Descriptions and Judgements
(2006-01-09)TREC Definition and Relationship questions are evaluated on thebasis of information nuggets that may be contained in systemresponses. Human evaluators provide informal descriptions of eachnugget, and judgements (assignments ... -
Object and Reference Immutability using Java Generics
(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
(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 ... -
Of Malicious Motes and Suspicious Sensors
(2006-04-19)How much damage can a malicious tiny device cause in a single-hopwireless network? Imagine two players, Alice and Bob, who want toexchange information. Collin, a malicious adversary, wants to preventthem from communicating. ... -
An $\Omega(n \log n)$ Lower Bound on the Cost of Mutual Exclusion
(2006-07-23)We prove an $\Omega(n \log n)$ lower bound on the number ofnon-busywaiting memory accesses by any deterministic algorithm solving$n$ process mutual exclusion that communicates via shared registers.The cost of the algorithm ... -
On a model of visual cortex: learning invariance and selectivity
(2008-04-04)In this paper we present a class of algorithms for similarity learning on spaces of images. The general framework that we introduce is motivated by some well-known hierarchical pre-processing architectures for object ... -
On Algorithms and Complexity for Sets with Cardinality Constraints
(2005-08-03)Typestate systems ensure many desirable properties of imperativeprograms, including initialization of object fields and correct use ofstateful library interfaces. Abstract sets with cardinalityconstraints naturally ... -
On Decision Procedures for Set-Value Fields
(2004-11-30)An important feature of object-oriented programming languages is the ability todynamically instantiate user-defined container data structures such as lists, trees,and hash tables. Programs implement such data structures ... -
On Field Constraint Analysis
(2005-11-03)We introduce field constraint analysis, a new technique for verifying data structure invariants. A field constraint for a field is a formula specifying a set of objects to which the field can point. Field constraints ... -
On Generalized Records and Spatial Conjunction in Role Logic
(2004-04-06)We have previously introduced role logic as a notation fordescribing properties of relational structures in shapeanalysis, databases and knowledge bases. A natural fragmentof role logic corresponds to two-variable logic ... -
On Modular Pluggable Analyses Using Set Interfaces
(2003-12-18)We present a technique that enables the focused applicationof multiple analyses to different modules in the same program. Our researchhas two goals: 1) to address the scalability limitations of preciseanalyses by focusing ... -
On Our Experience with Modular Pluggable Analyses
(2004-10-04)We present a technique that enables the focused applicationof multiple analyses to di erent modules in thesame program. In our approach, each module encapsulatesone or more data structures and uses membershipin abstract ... -
On Randomized Path Coverage of Configuration Spaces
(2013-11-18)We present a sampling-based algorithm that generates a set of locally-optimal paths that differ in visibility.
