Results 31 to 40 of about 827,412 (357)
Polynomial reconstruction of the matching polynomial
The matching polynomial of a graph is the generating function of the numbers of its matchings with respect to their cardinality. A graph polynomial is polynomial reconstructible, if its value for a graph can be determined from its values for the vertex-deleted subgraphs of the same graph.
Xueliang Li, Yongtang Shi, Martin Trinks
openaire +4 more sources
Polynomial cubic splines with tension properties [PDF]
In this paper we present a new class of spline functions with tension properties. These splines are composed by polynomial cubic pieces and therefore are conformal to the standard, NURBS based CAD/CAM ...
MANNI C. +13 more
core +1 more source
Proposal New S-box for AES Algorithm Depend on A.I Bee Colony [PDF]
The AES algorithm, also called the Rijndael algorithm, is a symmetric block cipher, where the data are encrypted/ decrypted in blocks of 128 bits. Each data block is modified by several rounds of processing, where each round involves four steps.
Alaa Kadhim, Sura Khalaf
doaj +1 more source
Fourier restriction to polynomial curves I: a geometric inequality [PDF]
We prove a Fourier restriction result for general polynomial curves in Rd. Measuring the Fourier restriction with respect to the affine arclength measure of the curve, we obtain a universal estimate for the class of all polynomial curves of bounded ...
Wright, James +5 more
core +1 more source
BOUNDS FOR VOLUMES OF SUB-LEVEL SETS OF POLYNOMIALS AND APPLICATIONS
In this paper, we present some explicit exponents in the estimates for the volumes of sub-level sets of polynomials on bounded sets and applications to the decay of oscillatory integrals and the convergence of singular integrals.
Loi Le Ta, Minh Quy Pham
doaj +1 more source
A remark on simultaneous inclusions of the zeros of a polynomial by Gershgorin's theorem [PDF]
Elsner L. A remark on simultaneous inclusions of the zeros of a polynomial by Gershgorin's theorem. Numerische Mathematik. 1973;21(5):425-427.By using Gershgorin's theorem and the theorems on minimal Gershgorin disks a posteriori error bounds for the ...
Elsner, Ludwig
core +2 more sources
Continuous monitoring of natural human gait in real-life environments is essential in many applications including disease monitoring, rehabilitation, and professional sports.
Erfan Shahabpoor, Aleksandar Pavic
doaj +1 more source
Evaluating the Tutte Polynomial for Graphs of Bounded Tree-Width [PDF]
It is known that evaluating the Tutte polynomial, $T(G; x, y)$, of a graph, $G$, is $\#$P-hard at all but eight specific points and one specific curve of the $(x, y)$-plane.
Noble, Steven, S. D. Noble, Noble, S D
core +1 more source
Recent advances in deep learning have bolstered our ability to forecast the evolution of dynamical systems, but common neural networks do not adhere to physical laws, critical information that could lead to sounder state predictions.
Frances Zhu +3 more
doaj +1 more source
Deterministic polynomial-time approximation algorithms for partition functions and graph polynomials [PDF]
We show a new way of constructing deterministic polynomial-time approximation algorithms for computing complex-valued evaluations of a large class of graph polynomials on bounded degree graphs.
Viresh Patel, Guus Regts
semanticscholar +1 more source

