Filters








1,929 Hits in 2.8 sec

Oblivious Online Contention Resolution Schemes [article]

Hu Fu, Pinyan Lu, Zhihao Gavin Tang, Abner Turkieltaub, Hongxun Wu, Jinzhao Wu, Qianfan Zhang
2021 arXiv   pre-print
Online contention resolution schemes (OCRSs), the online version, have found myriad applications in Bayesian and stochastic problems, such as prophet inequalities and stochastic probing.  ...  Contention resolution schemes (CRSs) are powerful tools for obtaining "ex post feasible" solutions from candidates that are drawn from "ex ante feasible" distributions.  ...  An online contention resolution scheme sees each element's status (of being active or not) in an online fashion, and must decide whether to select an element upon its arrival.  ... 
arXiv:2111.10607v1 fatcat:fay7xfsq4zgark2wivvw23wa6e

The Outer Limits of Contention Resolution on Matroids and Connections to the Secretary Problem

Shaddin Dughmi, Emanuela Merelli, Anuj Dawar, Artur Czumaj
2020 International Colloquium on Automata, Languages and Programming  
Second, we reduce the matroid secretary problem to the design of an online contention resolution scheme of a particular form.  ...  Contention resolution schemes have proven to be a useful and unifying abstraction for a variety of constrained optimization problems, in both offline and online arrival models.  ...  If m = 0, we say the scheme is oblivious: the scheme consists of a single contention resolution map.  ... 
doi:10.4230/lipics.icalp.2020.42 dblp:conf/icalp/Dughmi20 fatcat:pr6pnfkv6fcufkqg74fklynrha

The Outer Limits of Contention Resolution on Matroids and Connections to the Secretary Problem [article]

Shaddin Dughmi
2020 arXiv   pre-print
Second, we reduce the matroid secretary problem to the design of an online contention resolution scheme of a particular form.  ...  Contention resolution schemes have proven to be a useful and unifying abstraction for a variety of constrained optimization problems, in both offline and online arrival models.  ...  If m = 0, we say the scheme is oblivious: the scheme consists of a single contention resolution map.  ... 
arXiv:1909.04268v3 fatcat:2nxtnxvznzbirkggckkwnkv33y

On the Depth of Oblivious Parallel RAM [chapter]

T.-H. Hubert Chan, Kai-Min Chung, Elaine Shi
2017 Lecture Notes in Computer Science  
Oblivious Parallel RAM (OPRAM), first proposed by Boyle, Chung, and Pass, is the natural parallel extension of Oblivious RAM (ORAM).  ...  All prior OPRAM schemes adopt a single metric of "simulation overhead" that characterizes the blowup in parallel runtime, assuming that oblivious simulation is constrained to using the same number of CPUs  ...  In particular, this means that every memory location stores at most one data block and the content of the data block can be retrieved from that location independent of other storage. 2. Online OPRAM.  ... 
doi:10.1007/978-3-319-70694-8_20 fatcat:3o7m5oihojdwrltud6zudssxje

A Simple and Tight Greedy OCRS [article]

Vasilis Livanos
2021 arXiv   pre-print
When one does not have any control on the order of rounding, Online Contention Resolution Schemes (OCRSs) can be used instead, and have been successfully applied in settings such as prophet inequalities  ...  In recent years, Contention Resolution Schemes (CRSs), introduced by Chekuri, Vondrák, and Zenklusen, have emerged as a general framework for obtaining feasible solutions to combinatorial optimization  ...  Definition 1.2 (Online Contention Resolution Scheme (OCRS) [FSZ16] ).  ... 
arXiv:2111.13253v2 fatcat:zlh5kn5bdzdprexjlr3flt3d5y

Multi-dimensional mechanism design via random order contention resolution schemes

Marek Adamczyk, Michał Włodarczyk
2020 ACM SIGecom Exchanges  
Second, Feldman, Svensson and Zenklusen in 2016 adapted the Contention Resolution Scheme framework for online settings.  ...  We add to this line of work by considering the Contention Resolution Scheme framework in the random order setting.  ...  [Chekuri et al. 2014 ] presented a framework of contention resolution schemes (CR schemes) which address this problem, among other applications.  ... 
doi:10.1145/3381329.3381334 fatcat:uqh7sjhjarfeplrjryyvtl4thu

Web Services in Multimedia Communication

Mohamed Hamdi, Nabil Tabbane, Tai-Hoon Kim, Sajid Hussain
2012 Advances in Multimedia  
content.  ...  The advent of new efficient multimedia coding schemes has made it technologically feasible and economically viable to develop web services that encompass the real-time transmission of high-resolution multimedia  ... 
doi:10.1155/2012/129504 fatcat:ehrnfsifoveorml533t7xtvr6u

Oblivious Printing of Secret Messages in a Multi-party Setting [chapter]

Aleksander Essex, Urs Hengartner
2012 Lecture Notes in Computer Science  
We present multi-party protocols for obliviously printing a secret in three settings: obliviously printing the contents of a ciphertext, obliviously printing a randomized message, and generating and obliviously  ...  Finally we propose some potential applications of oblivious printing in the context of electronic voting and digital cash.  ...  In this paper we present the oblivious printing paradigm and give three novel multi-party protocols: in Section 3 we present a protocol for obliviously printing the contents of an encrypted message, in  ... 
doi:10.1007/978-3-642-32946-3_26 fatcat:j35ljb6lszeghfb3fyoa3qhmem

Multicasting MDC videos to receivers with different screen resolution

Rohan Gandhi, Dimitrios Koutsonikolas, Y. Charlie Hu
2011 Performance Evaluation Review  
that is oblivious of the client screen resolution diversity.  ...  Various schemes exploiting layered video coding schemes such as MRC and MDC have been proposed to address this problem.  ...  We modified the screen resolution oblivious strategy selection method in [4, 2] to take into account of the screen resolution diversity as follows.  ... 
doi:10.1145/2160803.2160878 fatcat:swcv3gtnx5burlptkaash7b5p4

A Divide and Conquer Strategy for Scaling Weather Simulations with Multiple Regions of Interest

Preeti Malakar, Thomas George, Sameer Kumar, Rashmi Mittal, Vijay Natarajan, Yogish Sabharwal, Vaibhav Saxena, Sathish S. Vadhiyar
2013 Scientific Programming  
Experiments on IBM Blue Gene systems using WRF show that the proposed strategies result in performance improvement of up to 33% with topology-oblivious mapping and up to additional 7% with topology-aware  ...  We describe topology-oblivious and topology-aware mapping heuristics in the following sections. 1) Topology-oblivious mapping: The partitioning scheme subdivides the processor space into rectangular regions  ...  We plan to explore other mapping/contention optimization algorithms as future work.  ... 
doi:10.1155/2013/682356 fatcat:ooxisusqkfdifev7divntbmzay

A divide and conquer strategy for scaling weather simulations with multiple regions of interest

Preeti Malakar, Thomas George, Sameer Kumar, Rashmi Mittal, Vijay Natarajan, Yogish Sabharwal, Vaibhav Saxena, Sathish S. Vadhiyar
2012 2012 International Conference for High Performance Computing, Networking, Storage and Analysis  
Experiments on IBM Blue Gene systems using WRF show that the proposed strategies result in performance improvement of up to 33% with topology-oblivious mapping and up to additional 7% with topology-aware  ...  We describe topology-oblivious and topology-aware mapping heuristics in the following sections. 1) Topology-oblivious mapping: The partitioning scheme subdivides the processor space into rectangular regions  ...  We plan to explore other mapping/contention optimization algorithms as future work.  ... 
doi:10.1109/sc.2012.4 dblp:conf/sc/MalakarG0MNSSV12 fatcat:geg4jtukvvg5jdwp4kgrtlqq5e

Online Contention Resolution Schemes [article]

Moran Feldman, Ola Svensson, Rico Zenklusen
2015 arXiv   pre-print
Our rounding technique, which we call online contention resolution schemes (OCRSs), is applicable to many online selection problems, including Bayesian online selection, oblivious posted pricing mechanisms  ...  We introduce a new rounding technique designed for online optimization problems, which is related to contention resolution schemes, a technique initially introduced in the context of submodular function  ...  Online contention resolution schemes OCRSs, like classical contention resolution schemes, are defined with respect to a relaxation of the feasible sets of a combinatorial optimization problem.  ... 
arXiv:1508.00142v2 fatcat:qoestynocvagbi6vgx325atfwi

Online Stochastic Max-Weight Matching: prophet inequality for vertex and edge arrival models [article]

Tomer Ezra, Michal Feldman, Nick Gravin, Zhihao Gavin Tang
2020 arXiv   pre-print
Our algorithms rely on the construction of suitable online contention resolution scheme (OCRS).  ...  We provide prophet inequality algorithms for online weighted matching in general (non-bipartite) graphs, under two well-studied arrival models, namely edge arrival and vertex arrival.  ...  and contention resolution schemes [27] .  ... 
arXiv:2002.09807v2 fatcat:nvoue6y6nbag3nyg3bsk6j27xm

Secure video processing: Problems and challenges

Wenjun Lu, Avinash Varna, Min Wu
2011 2011 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)  
Video is different from text due to its large data volume and rich content diversity.  ...  It has attracted a great amount of research attention due to the increasing demand to enable rich functionalities for private data stored online.  ...  Since online servers typically have large computational power, a secure processing scheme should be designed to outsource as much work as possible to the server while minimizing the preprocessing task  ... 
doi:10.1109/icassp.2011.5947693 dblp:conf/icassp/LuVW11 fatcat:ncdkynfeprab5mstgzf6mkl5py

The Circle Game

Sandeep Tamrakar, Jian Liu, Andrew Paverd, Jan-Erik Ekberg, Benny Pinkas, N. Asokan
2017 Proceedings of the 2017 ACM on Asia Conference on Computer and Communications Security - ASIA CCS '17  
Private membership test (PMT) schemes can remove this privacy concern. However, known PMT schemes do not scale well to a large number of simultaneous users and high query arrival rates.  ...  We highlight subtle aspects of securely implementing seemingly simple PMT schemes on these architectures.  ...  As with previous schemes, we used the concept of an oblivious page.  ... 
doi:10.1145/3052973.3053006 dblp:conf/ccs/TamrakarLPEPA17 fatcat:5qx4jmvsjje6ljgmxe6hz3wdku
« Previous Showing results 1 — 15 out of 1,929 results