Results 11 to 20 of about 8,222,439 (341)
Constructions of Optimal and Almost Optimal Locally Repairable Codes [PDF]
2014 4th International Conference on Wireless Communications, Vehicular Technology, Information Theory and Aerospace & Electronic Systems (VITAE), 2014 Constructions of optimal locally repairable codes (LRCs) in the case of $(r+1) \nmid n$ and over small finite fields were stated as open problems for LRCs in [I.
Ernvall, Toni +2 more
core +2 more sources
Almost optimal adaptive LQ control: observed state case [PDF]
Proceedings of 1995 34th IEEE Conference on Decision and Control, 1995 In this paper we propose an almost optimal indirect adaptive controller for input/state dynamical systems. The control part of the adaptive scheme is based on a modified LQ control law: by adding a time varying gain to the certainty equivalent control ...
Arent, Krzysztof +2 more
core +15 more sources
Deterministic Document Exchange Protocols, and Almost Optimal Binary Codes for Edit Errors [PDF]
IEEE Annual Symposium on Foundations of Computer Science, 2018 We study two basic problems regarding edit errors (insertions and deletions). The first one is document exchange, where two parties Alice and Bob hold two strings x and y with a bounded edit distance k.
Kuan Cheng +3 more
openalex +3 more sources
Almost Optimal Classical Approximation Algorithms for a Quantum Generalization of Max-Cut [PDF]
International Workshop and International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2019 Approximation algorithms for constraint satisfaction problems (CSPs) are a central direction of study in theoretical computer science. In this work, we study classical product state approximation algorithms for a physically motivated quantum ...
Gharibian, Sevag, Parekh, Ojas
core +3 more sources
Almost optimal dispersers [PDF]
Combinatorica, 1998 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Amnon Ta‐Shma
openalex +2 more sources
Almost Optimal Stochastic Weighted Matching With Few Queries [PDF]
ACM Conference on Economics and Computation, 2018 We consider the {\em stochastic matching} problem. An edge-weighted general (i.e., not necessarily bipartite) graph $G(V, E)$ is given in the input, where each edge in $E$ is {\em realized} independently with probability $p$; the realization is initially
Awasthi Pranjal +2 more
core +2 more sources
Federated Q-Learning with Reference-Advantage Decomposition: Almost Optimal Regret and Logarithmic Communication Cost [PDF]
arXiv.orgIn this paper, we consider model-free federated reinforcement learning for tabular episodic Markov decision processes. Under the coordination of a central server, multiple agents collaboratively explore the environment and learn an optimal policy without
Zhong Zheng, Haochen Zhang, Lingzhou Xue
openalex +2 more sources
Optimal states and almost optimal adaptive measurements for quantum interferometry [PDF]
Physical Review Letters, 2000 We derive the optimal N-photon two-mode input state for obtaining an estimate \phi of the phase difference between two arms of an interferometer. For an optimal measurement [B. C. Sanders and G. J. Milburn, Phys. Rev. Lett.
A. S. Holevo +11 more
core +6 more sources
Optimal Almost-Balanced Sequences [PDF]
2024 IEEE International Symposium on Information Theory (ISIT)This paper presents a novel approach to address the constrained coding challenge of generating almost-balanced sequences. While strictly balanced sequences have been well studied in the past, the problem of designing efficient algorithms with small redundancy, preferably constant or even a single bit, for almost balanced sequences has remained unsolved.
Daniella Bar-Lev +3 more
openalex +3 more sources
Almost Optimal Streaming Algorithms for Coverage Problems [PDF]
ACM Symposium on Parallelism in Algorithms and Architectures, 2017 Maximum coverage and minimum set cover problems --collectively called coverage problems-- have been studied extensively in streaming models. However, previous research not only achieve sub-optimal approximation factors and space complexities, but also ...
Cormode G. +3 more
core +2 more sources