Now showing items 580-599 of 765

    • 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.
    • Revenue in Truly Combinatorial Auctions and Adversarial Mechanism Design 

      Micali, Silvio; Valiant, Paul (2007- 11-0)
      Little is known about generating revenue in UNRESTRICTED combinatorial auctions. (In particular, the VCG mechanism has no revenue guarantees.) In this paper we determine how much revenue can be guaranteed in such auctions. ...
    • Revisiting Internet Adressing: Back to the Future! 

      Vutukuru, Mythili; Feamster, Nick; Walfish, Michael; Balakrishnan, Hari; Shenker, Scott (2006-04-14)
      IP prefixes undermine three goals of Internet routing: accurate reflection of network-layer reachability, secure routing messages, and effective traffic control. This paper presents Atomic IP (AIP), a simple change to ...
    • RingScalar: A Complexity-Effective Out-of-Order Superscalar Microarchitecture 

      Tseng, Jessica H.; Asanovic, Krste (2006-09-18)
      RingScalar is a complexity-effective microarchitecture for out-of-order superscalar processors, that reduces the area, latency, and power of all major structures in the instruction flow. The design divides an N-way ...
    • Risk Allocation for Multi-agent Systems using Tatonnement 

      Williams, Brian C.; Ono, Masahiro (2009-04-22)
      This paper proposes a new market-based distributed planning algorithm for multi-agent systems under uncertainty, called MIRA (Market-based Iterative Risk Allocation). In large coordination problems, from power grid management ...
    • Risk Allocation for Temporal Risk Assessment 

      Wang, Andrew J. (2013-01-31)
      Temporal uncertainty arises when performing any activity in the natural world. When activities are composed into temporal plans, then, there is a risk of not meeting the plan requirements. Currently, we do not have ...
    • Risk Bounds for Mixture Density Estimation 

      Rakhlin, Alexander; Panchenko, Dmitry; Mukherjee, Sayan (2004-01-27)
      In this paper we focus on the problem of estimating a boundeddensity using a finite combination of densities from a givenclass. We consider the Maximum Likelihood Procedure (MLE) and the greedy procedure described by Li ...
    • Risk Bounds for Regularized Least-squares Algorithm with Operator-valued kernels 

      Vito, Ernesto De; Caponnetto, Andrea (2005-05-16)
      We show that recent results in [3] on risk bounds for regularized least-squares on reproducing kernel Hilbert spaces can be straightforwardly extended to the vector-valued regression setting. We first briefly introduce ...