Results 21 to 30 of about 8,222,439 (341)
Almost optimal distance oracles for planar graphs [PDF]
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2018 We present new tradeoffs between space and query-time for exact distance oracles in directed weighted planar graphs. These tradeoffs are almost optimal in the sense that they are within polylogarithmic, subpolynomial or arbitrarily small polynomial ...
P. Charalampopoulos +3 more
semanticscholar +4 more sources
An optimal transportation approach for assessing almost stochastic order [PDF]
, 2017 When stochastic dominance $F\leq_{st}G$ does not hold, we can improve agreement to stochastic order by suitably trimming both distributions. In this work we consider the $L_2-$Wasserstein distance, $\mathcal W_2$, to stochastic order of these trimmed ...
E. del Barrio +2 more
openalex +3 more sources
Almost Optimal Sublinear Time Algorithm for Semidefinite Programming [PDF]
, 2012 We present an algorithm for approximating semidefinite programs with running time that is sublinear in the number of entries in the semidefinite instance.
Dan Garber, Elad Hazan
openalex +4 more sources
Almost Optimal Unrestricted Fast Johnson-Lindenstrauss Transform [PDF]
ACM Transactions on Algorithms, 2010 The problems of random projections and sparse reconstruction have much in common and individually received much attention. Surprisingly, until now they progressed in parallel and remained mostly separate.
Ailon, Nir, Liberty, Edo
core +4 more sources
Almost Optimal Cover-Free Families [PDF]
International/Italian Conference on Algorithms and Complexity, 2015 Roughly speaking, an $(n,(r,s))$-Cover Free Family (CFF) is a small set of $n$-bit strings such that: "in any $d:=r+s$ indices we see all patterns of weight $r$".
N. Bshouty, Ariel Gabizon
semanticscholar +3 more sources
Almost Optimal Testers for Concise Representations
Electron. Colloquium Comput. Complex., 2019 We give improved and almost optimal testers for several classes of Boolean functions on $n$ inputs that have concise representation in the uniform and distribution-free model.
N. Bshouty
semanticscholar +5 more sources
Almost-optimal sublinear-time edit distance in the low distance regime [PDF]
Symposium on the Theory of Computing, 2022 We revisit the task of computing the edit distance in sublinear time. In the (k,K)-gap edit distance problem we are given oracle access to two strings of length n and the task is to distinguish whether their edit distance is at most k or at least K.
K. Bringmann +3 more
semanticscholar +1 more source
Almost Optimal Variance-Constrained Best Arm Identification [PDF]
IEEE Transactions on Information Theory, 2022 We design and analyze Variance-Aware-Lower and Upper Confidence Bound (VA-LUCB), a parameter-free algorithm, for identifying the best arm under the fixed-confidence setup and under a stringent constraint that the variance of the chosen arm is strictly ...
Yunlong Hou, V. Tan, Zixin Zhong
semanticscholar +1 more source
Clustering mixtures with almost optimal separation in polynomial time [PDF]
Symposium on the Theory of Computing, 2021 We consider the problem of clustering mixtures of mean-separated Gaussians in high dimensions. We are given samples from a mixture of k identity covariance Gaussians, so that the minimum pairwise distance between any two pairs of means is at least Δ, for
J. Li, Allen Liu
semanticscholar +1 more source
Almost Optimal Inapproximability of Multidimensional Packing Problems [PDF]
IEEE Annual Symposium on Foundations of Computer Science, 2021 Multidimensional packing problems generalize the classical packing problems such as Bin Packing, Multiprocessor Scheduling by allowing the jobs to be d-dimensional vectors.
Sai Sandeep
semanticscholar +1 more source