Open Access Repositories: Recent submissions

Now showing items 1741-1760 of 4204

  • Variable selection with error control: Another look at Stability Selection 

    Shah, Rajen Dinesh; Samworth, Richard John (Wiley on behalf of the Royal Statistical SocietyJournal of the Royal Statistical Society: Series B (Statistical Methodology), 2012-06-21)
    Stability Selection was recently introduced by Meinshausen and B¨uhlmann (2010) as a very general technique designed to improve the performance of a variable selection algorithm. It is based on aggregating the results of ...

  • A Benchmark of Computational Models of Saliency to Predict Human Fixations 

    Unknown author (2012-01-13)
    Many computational models of visual attention have been created from a wide variety of different approaches to predict where people look in images. Each model is usually introduced by demonstrating performances on new ...

  • Structuring Unreliable Radio Networks 

    Unknown author (2011-12-22)
    In this paper we study the problem of building a connected dominating set with constant degree (CCDS) in the dual graph radio network model. This model includes two types of links: reliable links, which always deliver ...

  • A Frequency Analysis of Monte-Carlo and other Numerical Integration Schemes 

    Unknown author (2011-12-14)
    The numerical calculation of integrals is central to many computer graphics algorithms such as Monte-Carlo Ray Tracing. We show that such methods can be studied using Fourier analysis. Numerical error is shown to correspond ...

  • CPHash: A Cache-Partitioned Hash Table 

    Unknown author (2011-11-26)
    CPHash is a concurrent hash table for multicore processors. CPHash partitions its table across the caches of cores and uses message passing to transfer lookups/inserts to a partition. CPHash's message passing avoids the ...

  • Reasoning about Relaxed Programs 

    Unknown author (2011-11-15)
    A number of approximate program transformations have recently emerged that enable transformed programs to trade accuracy of their results for increased performance by dynamically and nondeterministically modifying variables ...

  • Fast and Robust Pyramid-based Image Processing 

    Unknown author (2011-11-15)
    Multi-scale manipulations are central to image editing but they are also prone to halos. Achieving artifact-free results requires sophisticated edgeaware techniques and careful parameter tuning. These shortcomings were ...

  • SEEC: A General and Extensible Framework for Self-Aware Computing 

    Unknown author (2011-11-07)
    Modern systems require applications to balance competing goals, e.g. achieving high performance and low power. Achieving this balance places an unrealistic burden on application programmers who must understand the power ...

  • Leader Election Using Loneliness Detection 

    Unknown author (2011-10-12)
    We consider the problem of leader election (LE) in single-hop radio networks with synchronized time slots for transmitting and receiving messages. We assume that the actual number n of processes is unknown, while the size ...

  • Automatic Input Rectification 

    Unknown author (MIT CSAIL, 2011-10-03)
    We present a novel technique, automatic input rectification, and a prototype implementation called SOAP. SOAP learns a set of constraints characterizing typical inputs that an application is highly likely to process ...

  • Multi-Class Learning: Simplex Coding And Relaxation Error 

    Unknown author (2011-09-27)
    We study multi-category classification in the framework of computational learning theory. We show how a relaxation approach, which is commonly used in binary classification, can be generalized to the multi-class setting. ...

  • Nonparametric Sparsity and Regularization 

    Unknown author (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 hypothesis-based algorithm for planning and control in non-Gaussian belief spaces 

    Russ Tedrake; Robot Locomotion Group (2011-08-27)
    We consider the partially observable control problem where it is potentially necessary to perform complex information-gathering operations in order to localize state. One approach to solving these problems is to create ...

  • Learning and disrupting invariance in visual recognition 

    Unknown author (2011-09-10)
    Learning by temporal association rules such as Foldiak's trace rule is an attractive hypothesis that explains the development of invariance in visual recognition. Consistent with these rules, several recent experiments ...

  • Tragedy of the routing table: An analysis of collective action amongst Internet network operators 

    Unknown author (2011-08-06)
    This thesis analyzes and discusses the effectiveness of social efforts to achieve collective action amongst Internet network operators in order to manage the growth of the Internet routing table. The size and rate of growth ...

  • MOOS-IvP Autonomy Tools Users Manual Release 4.2.1 

    Unknown author (2011-07-28)
    This document describes 19 MOOS-IvP autonomy tools. uHelmScope provides a run-time scoping window into the state of an active IvP Helm executing its mission. pMarineViewer is a geo-based GUI tool for rendering marine ...

  • An Overview of MOOS-IvP and a Users Guide to the IvP Helm - Release 4.2.1 

    Unknown author (2011-08-03)
    This document describes the IvP Helm - an Open Source behavior-based autonomy application for unmanned vehicles. IvP is short for interval programming - a technique for representing and solving multi-objective optimizations ...

  • Vote the OS off your Core 

    Unknown author (2011-07-27)
    Recent trends in OS research have shown evidence that there are performance benefits to running OS services on different cores than the user applications that rely on them. We quantitatively evaluate this claim in terms ...

  • A Scalable Information Theoretic Approach to Distributed Robot Coordination 

    Unknown author (2011-09-25)
    This paper presents a scalable information theoretic approach to infer the state of an environment by distributively controlling robots equipped with sensors. The robots iteratively estimate the environment state using a ...

  • Kernels for Vector-Valued Functions: a Review 

    Unknown author (2011-06-30)
    Kernel methods are among the most popular techniques in machine learning. From a frequentist/discriminative perspective they play a central role in regularization theory as they provide a natural choice for the hypotheses ...