Analytical approach to parallel repetition
I Dinur, D Steurer - Proceedings of the forty-sixth annual ACM …, 2014 - dl.acm.org
We propose an analytical framework for studying parallel repetition, a basic product
operation for one-round twoplayer games. In this framework, we consider a relaxation of the …
operation for one-round twoplayer games. In this framework, we consider a relaxation of the …
Elastic and reliable bandwidth reservation based on distributed traffic monitoring and control
X Zhang, T Wang - IEEE Transactions on Parallel and …, 2022 - ieeexplore.ieee.org
Bandwidth reservation can effectively improve the service quality for data transfers because
of dedicated network resources. However, it is difficult to achieve a desired tradeoff between …
of dedicated network resources. However, it is difficult to achieve a desired tradeoff between …
Collective spatial keyword querying
With the proliferation of geo-positioning and geo-tagging, spatial web objects that possess
both a geographical location and a textual description are gaining in prevalence, and spatial …
both a geographical location and a textual description are gaining in prevalence, and spatial …
The Projection Games Conjecture and the NP-Hardness of ln n-Approximating Set-Cover
D Moshkovitz - International Workshop on Approximation Algorithms …, 2012 - Springer
We suggest the research agenda of establishing new hardness of approximation results
based on the “projection games conjecture”, ie, an instantiation of the Sliding Scale …
based on the “projection games conjecture”, ie, an instantiation of the Sliding Scale …
Power-aware computing in wearable sensor networks: An optimal feature selection
Wearable sensory devices are becoming the enabling technology for many applications in
healthcare and well-being, where computational elements are tightly coupled with the …
healthcare and well-being, where computational elements are tightly coupled with the …
Data x-ray: A diagnostic tool for data errors
A lot of systems and applications are data-driven, and the correctness of their operation
relies heavily on the correctness of their data. While existing data cleaning techniques can …
relies heavily on the correctness of their data. While existing data cleaning techniques can …
An ant colony optimization algorithm with improved pheromone correction strategy for the minimum weight vertex cover problem
R Jovanovic, M Tuba - Applied Soft Computing, 2011 - Elsevier
The minimum weight vertex cover problem is an interesting and applicable NP-hard problem
that has been investigated from many different aspects. The ant colony optimization …
that has been investigated from many different aspects. The ant colony optimization …
Digital twin-empowered network planning for multi-tier computing
In this paper, we design a resource management scheme to support stateful applications,
which will be prevalent in sixth generation (6G) networks. Different from stateless …
which will be prevalent in sixth generation (6G) networks. Different from stateless …
On Spectrum Efficient Failure-Independent Path Protection p-Cycle Design in Elastic Optical Networks
High spectrum efficiency and fast restoration speed are highly desired for survivable elastic
optical networks (EONs). In this paper, we take the advantages of failure-independent path …
optical networks (EONs). In this paper, we take the advantages of failure-independent path …
Quasi-linear size pcps with small soundness from hdx
We construct 2-query, quasi-linear size probabilistically checkable proofs (PCPs) with
arbitrarily small constant soundness, improving upon Dinur's 2-query quasi-linear size PCPs …
arbitrarily small constant soundness, improving upon Dinur's 2-query quasi-linear size PCPs …