Results 31 to 40 of about 912,120 (337)
Note on the smallest root of the independence polynomial [PDF]
, 2013 One can define the independence polynomial of a graph G as follows. Let i(k)(G) denote the number of independent sets of size k of G, where i(0)(G) = 1. Then the independence polynomial of G is I(G,x) = Sigma(n)(k=0)(-1)(k)i(k)(G)x(k).
Csíkvári, Péter
core +1 more source
A two-variable approach to solve the polynomial Lyapunov equation
, 2001 A two-variable polynomial approach to solve the one-variable polynomial Lyapunov equation is proposed. Lifting the problem from the one-variable to the two-variable context allows to use Faddeev-type recursions in order to solve the polynomial Lyapunov ...
Peeters, Ralf, Rapisarda, Paolo
core +2 more sources
Sensors, 2018 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
BOUNDS FOR VOLUMES OF SUB-LEVEL SETS OF POLYNOMIALS AND APPLICATIONS
Tạp chí Khoa học Đại học Đà Lạt, 2022 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
Deterministic polynomial-time approximation algorithms for partition functions and graph polynomials [PDF]
Electron. Notes Discret. Math., 2016 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
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018 The approximate degree of a Boolean function $f(x_{1},x_{2},\ldots,x_{n})$ is the minimum degree of a real polynomial that approximates $f$ pointwise within $1/3$. Upper bounds on approximate degree have a variety of applications in learning theory, differential privacy, and algorithm design in general.
openaire +5 more sources
Frontiers in Robotics and AI, 2022 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
Polynomial Trajectory Planning for Aggressive Quadrotor Flight in Dense Indoor Environments
International Symposium of Robotics Research, 2016 We explore the challenges of planning trajectories for quadrotors through cluttered indoor environments. We extend the existing work on polynomial trajectory generation by presenting a method of jointly optimizing polynomial path segments in an ...
Charles Richter, Adam Bry, N. Roy
semanticscholar +1 more source
Fourier restriction to polynomial curves I: a geometric inequality [PDF]
, 2010 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
Проблемы анализа, 2023 The starting point in the theory of differential inequalities for polynomials is the book "Investigation of aqueous solutions by specific gravity" by D. I. Mendeleev. In this work, he dealt not only with chemical, but also mathematical problems.
E. G. Kompaneets, L. G. Zybina
doaj +1 more source