Now showing items 573-592 of 765

    • 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 ...
    • Remote Oblivious Storage: Making Oblivious RAM Practical 

      Boneh, Dan; Mazieres, David; Popa, Raluca Ada (2011-03-30)
      Remote storage of data has become an increasingly attractive and advantageous option, especially due to cloud systems. While encryption protects the data, it does not hide the access pattern to the data. A natural solution ...
    • Remote Store Programming: Mechanisms and Performance 

      Wentzlaff, David; Agarwal, Anant; Hoffmann, Henry (2009-05-05)
      This paper presents remote store programming (RSP). This paradigm combines usability and efficiency through the exploitation of a simple hardware mechanism, the remote store, which can easily be added to existing ...
    • Report on the 2015 NSF Workshop on Unified Annotation Tooling 

      Finlayson, Mark Alan (2016-11-08)
      On March 30 & 31, 2015, an international group of twenty-three researchers with expertise in linguistic annotation convened in Sunny Isles Beach, Florida to discuss problems with and potential solutions for the state of ...
    • Report on the Probabilistic Language Scheme 

      Radul, Alexey (2007-10-22)
      Reasoning with probabilistic models is a widespread andsuccessful technique in areas ranging from computer vision, to naturallanguage processing, to bioinformatics. Currently, these reasoningsystems are either coded from ...
    • Representation and Detection of Shapes in Images 

      Felzenszwalb, Pedro F. (2003-08-08)
      We present a set of techniques that can be used to represent anddetect shapes in images. Our methods revolve around a particularshape representation based on the description of objects usingtriangulated polygons. This ...
    • Representation Discovery for Kernel-Based Reinforcement Learning 

      Zewdie, Dawit H.; Konidaris, George (2015-11-24)
      Recent years have seen increased interest in non-parametric reinforcement learning. There are now practical kernel-based algorithms for approximating value functions; however, kernel regression requires that the underlying ...
    • Representing Small Group Evolution 

      Wormald, Nicholas; Richards, Whitman (2009-03-30)
      Understanding the dynamics of network evolution rests in part on the representation chosen to characterize the evolutionary process. We offer a simple, three-parameter representation based on subgraphs that capture three ...
    • Resilient Provision of a Public and/or Private Good, or: Resilient Auctions of One Good in Unlimited Supply 

      Chen, Jing; Micali, Silvio (2008-12-02)
      We present two resilient mechanisms: the first for the provision of a public good, and the second for the provision of a private good. Both mechanisms adopt a knowledge-based benchmark.
    • Resilient Auctions of One Good in Limited Supply 

      Micali, Silvio; Chen, Jing (2008-12-17)
      We present various resilient auction mechanisms for a good in limited supply. Our mechanisms achieve both player-knowledge and aggregated player-knowledge benchmarks.
    • Resilient Knowledge-Based Mechanisms For Truly Combinatorial Auctions (And Implementation in Surviving Strategies) 

      Micali, Silvio; Chen, Jing (2008-10-08)
      We put forward a new mechanism achieving a high benchmark for (both revenue and) the sum of revenue and efficiency in truly combinatorial auctions. Notably, our mechanism guarantees its performance (1) in a very adversarial ...
    • Resilient Mechanisms For Truly Combinatorial Auctions 

      Micali, Silvio; Valiant, Paul (2008-11-13)
      Dominant-strategy truthfulness is traditionally considered the best possible solution concept in mechanism design, as it enables one to predict with confidence which strategies INDEPENDENT players will actually choose. ...
    • Resilient Network Coding In the Presence of Byzantine Adversaries 

      Jaggi, Sidharth; Langberg, Michael; Katti, Sachin; Ho, Tracy; Katabi, Dina; e.a. (2006-08-05)
      Network coding substantially increases network throughput. But since it involves mixing of information inside the network, a single corrupted packet generated by a malicious node can end up contaminating all the information ...
    • Resilient Provision of a Public Good 

      Micali, Silvio; Chen, Jing (2008-12-02)
      We present two resilient mechanisms for the provision of a public good. Both mechanisms adopt a knowledge-based benchmark.