Results 11 to 20 of about 17,304 (236)
Terminal Embeddings in Sublinear Time [PDF]
2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS), 2021 Recently (Elkin, Filtser, Neiman 2017) intro-duced the concept of a terminal embedding from one met-ric space to another with a set of designated terminals.
Yeshwanth Cherapanamjeri, Jelani Nelson
semanticscholar +6 more sources
Sublinear geometric algorithms [PDF]
Proceedings of the thirty-fifth ACM symposium on Theory of computing - STOC '03, 2003 We present sublinear algorithms to such problems as Detecting of Polytope intersection, Shortest Path on 3D convex Polytopes and volume approximation.
Chazelle, Bernard +2 more
openaire +4 more sources
Existence of Solutions for Sublinear Kirchhoff Problems with Sublinear Growth [PDF]
Mathematical Problems in Engineering, 2019 In this paper, we consider the following sublinear Kirchhoff problems , in , where a > 0 and b ≥ 0 with N ≥ 3. A new sublinear growth condition is given. When f(x, u) is not odd in u and not integrable in x, we obtain the existence of solutions for the above problem.
Wei Yang, Zhan Wang, Zhuo Yao
openaire +2 more sources
Sublinear Longest Path Transversals [PDF]
SIAM Journal on Discrete Mathematics, 2021 We show that connected graphs admit sublinear longest path transversals. This improves an earlier result of Rautenbach and Sereni and is related to the fifty-year-old question of whether connected graphs admit longest path transversals of constant size.
James A. Long Jr. +2 more
openaire +4 more sources
On weighted sublinear separators [PDF]
Journal of Graph Theory, 2021 AbstractConsider a graph with an assignment of costs to vertices. Even if and all its subgraphs admit balanced separators of sublinear size, may only admit a balanced separator of sublinear cost after deleting a small set of exceptional vertices. We improve the bound on from to , for any fixed number of iterations of the logarithm.
openaire +2 more sources
Sublinear time spectral density estimation [PDF]
Symposium on the Theory of Computing, 2021 We present a new sublinear time algorithm for approximating the spectral density (eigenvalue distribution) of an n× n normalized graph adjacency or Laplacian matrix.
V. Braverman +2 more
semanticscholar +1 more source
Multiplication by a Constant is Sublinear [PDF]
18th IEEE Symposium on Computer Arithmetic (ARITH '07), 2007 This paper explores the use of the double-base number system (DBNS) for constant integer multiplication. The DBNS recoding scheme represents integers – in this case constants – in a multiple-radix way in the hope of minimizing the number of additions to be performed during constant multiplication.
Dimitrov, Vassil +2 more
openaire +2 more sources
Longest Palindromic Substring in Sublinear Time
Annual Symposium on Combinatorial Pattern Matching, 2022 We revisit the classic algorithmic problem of computing a longest palidromic substring. This problem is solvable by a celebrated O ( n )-time algorithm [Manacher, J. ACM 1975], where n is the length of the input string.
P. Charalampopoulos +2 more
semanticscholar +1 more source
Time-Optimal Sublinear Algorithms for Matching and Vertex Cover [PDF]
IEEE Annual Symposium on Foundations of Computer Science, 2021 We study the problem of estimating the size of maximum matching and minimum vertex cover in sub linear time. Denoting the number of vertices by $n$ and the average degree in the graph by $\overline{d}$, we obtain the following results for both problems ...
Soheil Behnezhad
semanticscholar +1 more source
A general form for precise asymptotics for complete convergence under sublinear expectation
AIMS Mathematics, 2022 Let $ \{X_n, n\geq 1\} $ be a sequence of independent and identically distributed random variables in a sublinear expectation $ (\Omega, \mathcal H, {\mathbb {\widehat{E}}}) $ with a capacity $ {\mathbb V} $ under $ {\mathbb {\widehat{E}}} $.
Xue Ding
semanticscholar +1 more source