Now showing items 557-576 of 762

    • RamboNodes for the Metropolitan Ad Hoc Network 

      Beal, Jacob; Gilbert, Seth (2003-12-17)
      We present an algorithm to store data robustly in a large, geographically distributed network by means of localized regions of data storage that move in response to changing conditions. For example, data might migrate away ...
    • Random Lens Imaging 

      Fergus, Rob; Torralba, Antonio; Freeman, William T. (2006-09-02)
      We call a random lens one for which the function relating the input light ray to the output sensor location is pseudo-random. Imaging systems with random lensescan expand the space of possible camera designs, allowing new ...
    • Random-World Semantics and Syntactic Independence for Expressive Languages 

      McAllester, David; Milch, Brian; Goodman, Noah D. (2008-05-03)
      We consider three desiderata for a language combining logic and probability: logical expressivity, random-world semantics, and the existence of a useful syntactic condition for probabilistic independence. Achieving these ...
    • Rank Priors for Continuous Non-Linear Dimensionality Reduction 

      Stiefelhagen, Rainer; Darrell, Trevor; Urtasun, Raquel; Geiger, Andreas (2008-09-26)
      Non-linear dimensionality reduction methods are powerful techniques to deal with high-dimensional datasets. However, they often are susceptible to local minima and perform poorly when initialized far from the global optimum, ...
    • Rational Robustness for Mechanism Design 

      Micali, Silvio; Chen, Jing (2009-11-10)
      The currently prevailing equilibrium-based approach to mechanism design suffers from a plurality of fundamental problems, and new conceptual frameworks are needed to solve or sufficiently alleviate them. In this paper, we ...
    • Reactive Integrated Motion Planning and Execution Using Chekhov 

      Shroff, Ameya (2013-06-06)
      We envision a world in which robots and humans can collaborate to perform complex tasks in real-world environments. Current motion planners successfully generate trajectories for a robot with multiple degrees of freedom, ...
    • Realistic Modeling of Simple and Complex Cell Tuning in the HMAXModel, and Implications for Invariant Object Recognition in Cortex 

      Serre, Thomas; Riesenhuber, Maximilian (2004-07-27)
      Riesenhuber \& Poggio recently proposed a model of object recognitionin cortex which, beyond integrating general beliefs about the visualsystem in a quantitative framework, made testable predictions aboutvisual processing. ...
    • Reasoning about Relaxed Programs 

      Carbin, Michael; Kim, Deokhwan; Misailovic, Sasa; Rinard, Martin C. (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 ...
    • Receptive field structures for recognition 

      Balas, Benjamin; Sinha, Pawan (2005-03-01)
      Localized operators, like Gabor wavelets and difference-of-Gaussian filters, are considered to be useful tools for image representation. This is due to their ability to form a ‘sparse code’ that can serve as a basis set ...
    • ReCrash: Making Crashes Reproducible 

      Kim, Sunghun; Artzi, Shay; Ernst, Michael D. (2007-11-20)
      It is difficult to fix a problem without being able to reproduce it.However, reproducing a problem is often difficult and time-consuming.This paper proposes a novel algorithm, ReCrash, that generatesmultiple unit tests ...
    • Recursively invoking Linnaeus: A Taxonomy for Naming Systems 

      Sollins, Karen R. (2002-03-01)
      Naming is a central element of a distributed or network system design. Appropriate design choices are central. This paper explores a taxonomy of naming systems, and engineering tradeoffs as an aid to the namespace designer. ...
    • REED: Robust, Efficient Filtering and Event Detection in Sensor Networks 

      Abadi, Daniel J.; Madden, Samuel R. (2004-03-22)
      This paper presents an algorithm for handling many types of filters insensor networks that cannot be expressed using a simple predicate.Specifically, the action of the filter may be predicated on sensor produceddata where ...
    • Refactoring for parameterizing Java classes 

      Kiezun, Adam; Ernst, Michael D.; Tip, Frank; Fuhrer, Robert M. (2006-09-05)
      Type safety and expressiveness of many existing Java libraries and theirclient applications would improve, if the libraries were upgraded to definegeneric classes. Efficient and accurate tools exist to assist clientapplications ...
    • Refactoring Sequential Java Code for Concurrency via Concurrent Libraries 

      Ernst, Michael D.; Marrero, John; Dig, Danny (2008-09-30)
      Parallelizing existing sequential programs to run efficiently on multicores is hard. The Java 5 packagejava.util.concurrent (j.u.c.) supports writing concurrent programs: much of the complexity of writing threads-safe and ...
    • Regularization Predicts While Discovering Taxonomy 

      Mroueh, Youssef; Poggio, Tomaso; Rosasco, Lorenzo (2011-06-03)
      In this work we discuss a regularization framework to solve multi-category when the classes are described by an underlying class taxonomy. In particular we discuss how to learn the class taxonomy while learning a multi-category ...
    • Regularization Through Feature Knock Out 

      Wolf, Lior; Martin, Ian (2004-11-12)
      In this paper, we present and analyze a novel regularization technique based on enhancing our dataset with corrupted copies of the original data. The motivation is that since the learning algorithm lacks information about ...
    • Relational Cloud: The Case for a Database Service 

      Wu, Eugene; Madden, Samuel; Zhang, Yang; Jones, Evan; Curino, Carlo (2010-03-14)
      In this paper, we make the case for â databases as a serviceâ (DaaS), with two target scenarios in mind: (i) consolidation of data management functionality for large organizations and (ii) outsourcing data management ...
    • Relational Envelope-based Planning 

      Gardiol, Natalia Hernandez (2007-12-31)
      This thesis proposes a synthesis of logic and probability for solving stochastic sequential decision-making problems. We address two main questions: How can we take advantage of logical structure to speed up planning in a ...
    • Reliability-Aware Optimization of Approximate Computational Kernels with Rely 

      Misailovic, Sasa; Carbin, Michael; Achour, Sara; Qi, Zichao; Rinard, Martin (2014-01-09)
      Emerging high-performance architectures are anticipated to contain unreliable components (e.g., ALUs) that offer low power consumption at the expense of soft errors. Some applications (such as multimedia processing, machine ...
    • Reliably Detecting Connectivity using Local Graph Traits 

      Cornejo, Alejandro; Lynch, Nancy (2010-09-09)
      Local distributed algorithms can only gather sufficient information to identify local graph traits, that is, properties that hold within the local neighborhood of each node. However, it is frequently the case that global ...