Results 31 to 40 of about 8,222,439 (341)
Almost Optimal Exact Distance Oracles for Planar Graphs
Journal of the ACM, 2023 We consider the problem of preprocessing a weighted directed planar graph in order to quickly answer exact distance queries. The main tension in this problem is between space S and query time Q, and since the mid-1990s all results had polynomial time ...
P. Charalampopoulos +6 more
semanticscholar +1 more source
Approximate solution of nonlinear hyperbolic equations with homogeneous jump conditions
Journal of Numerical Analysis and Approximation Theory, 2019 We present the error analysis of class of second order nonlinear hyperbolic interface problem where the spatial and time discretizations are based on finite element method and linearized backward difference scheme respectively. Both semi discrete and
Matthew Olayiwola Adewole
doaj +7 more sources
Simple Economies are Almost Optimal [PDF]
Proceedings of the 22nd ACM Conference on Economics and Computation, 2021 Consider a seller that intends to auction some item. The seller can invest money and effort in advertising in different market segments in order to recruit $n$ bidders to the auction. Alternatively, the seller can have a much cheaper and focused marketing operation and recruit the same number of bidders from a single market segment.
Ban, Amir +3 more
openaire +2 more sources
Almost optimal super-constant-pass streaming lower bounds for reachability
Electron. Colloquium Comput. Complex., 2021 We give an almost quadratic n2−o(1) lower bound on the space consumption of any o(√logn)-pass streaming algorithm solving the (directed) s-t reachability problem. This means that any such algorithm must essentially store the entire graph. As corollaries,
Lijie Chen +5 more
semanticscholar +1 more source
Optimal Inequalities on (α,β)-Type Almost Contact Manifold with the Schouten–Van Kampen Connection
Axioms, 2023 In the current research, we develop optimal inequalities for submanifolds in trans-Sasakian manifolds or (α,β)-type almost contact manifolds endowed with the Schouten–Van Kampen connection (SVK-connection), including generalized normalized δ-Casorati ...
Mohd Danish Siddiqi, Ali H. Hakami
doaj +1 more source
Weight distributions for projective binary linear codes from Weil sums
AIMS Mathematics, 2021 A class of projective binary linear codes are constructed and their weight distributions are investigated using Weil sums. They have at most three nonzero weights, containing some optimal codes.
Shudi Yang, Zheng-An Yao
doaj +1 more source
Almost-Optimal Gossip-Based Aggregate Computation [PDF]
SIAM Journal on Computing, 2012 Motivated by applications to modern networking technologies, there has been interest in designing efficient gossip-based protocols for computing aggregate functions. While gossip-based protocols provide robustness due to their randomized nature, reducing the message and time complexity of these protocols is also of paramount importance in the context ...
Chen, Jen-Yeu, Pandurangan, Gopal
openaire +3 more sources
Balanced optimal almost binary sequence pairs of period N≡1（mod4）
Tongxin xuebao, 2021 Based on the combinatorial design theory， the constructions of balanced optimal almost binary sequence pairs of period N≡1（mod 4）were researched.The maximal cross-correlation values θc were obtained by different combinations of （almost） binary sequence ...
Xiuping PENG +3 more
doaj +2 more sources
Applied Sciences, 2021 For the assumed bale volume, its dimensions (diameter, height), minimizing the consumption of the plastic film used for bale wrapping with the combined 3D method, depend on film and wrapping parameters.
Anna Stankiewicz
doaj +1 more source
Constructing Higher Nonlinear Odd-Variable RSBFs With Optimal AI and Almost Optimal FAI
IEEE Access, 2019 Rotation symmetric Boolean functions (RSBFs) are nowadays studied a lot because of its easy operations and good performance in cryptosystem. This paper constructs a new class of odd-variable RSBFs with optimal algebraic immunity (AI). The nonlinearity of
Yindong Chen +5 more
doaj +1 more source