Results 31 to 40 of about 3,572,424 (305)
Fast constant-time gcd computation and modular inversion
IACR Cryptology ePrint Archive, 2019 This paper introduces streamlined constant-time variants of Euclid’s algorithm, both for polynomial inputs and for integer inputs. As concrete applications, this paper saves time in (1) modular inversion for Curve25519, which was previously believed to ...
D. Bernstein, Bo-Yin Yang
semanticscholar +1 more source
Edit Distance with Block Deletions
Algorithms, 2011 Several variants of the edit distance problem with block deletions are considered. Polynomial time optimal algorithms are presented for the edit distance with block deletions allowing character insertions and character moves, but without block moves.
Dana Shapira, James A. Storer
doaj +1 more source
A Jacobi Dual-Petrov-Galerkin Method for Solving Some Odd-Order Ordinary Differential Equations
Abstract and Applied Analysis, 2011 A Jacobi dual-Petrov-Galerkin (JDPG) method is introduced and used for solving fully integrated reformulations of third- and fifth-order ordinary differential equations (ODEs) with constant coefficients.
E. H. Doha, A. H. Bhrawy, R. M. Hafez
doaj +1 more source
The best constant of Sobolev inequality corresponding to anti-periodic boundary value problem
Electronic Journal of Qualitative Theory of Differential Equations, 2014 In this paper we establish the best constant of $\mathcal{L}^{p}$ Sobolev inequality for a function with anti-periodic boundary conditions. The best constant is expressed by $\mathcal{L}^q$ norm of $(M-1)$-th order Euler polynomial.
Jozef Kiseľák
doaj +1 more source
The Zhegalkin Polynomial of Multiseat Sole Sufficient Operator
Моделирование и анализ информационных систем, 2023 Among functionally complete sets of Boolean functions, sole sufficient operators are of particular interest. They have a wide range of applicability and are not limited to the two-seat case.
Leonid Y. Bystrov, Egor V. Kuzmin
doaj +1 more source
Determining projection constants of univariate polynomial spaces
Journal of Approximation Theory, 2018 The long-standing problem of minimal projections is addressed from a computational point of view. Techniques to determine bounds on the projection constants of univariate polynomial spaces are presented. The upper bound, produced by a linear program, and the lower bound, produced by a semidefinite program exploiting the method of moments, are often ...
Foucart, Simon, Lasserre, Jean-Bernard
openaire +5 more sources
A New Method to Obtain PH-Helical Curves in E^(n+1)
Journal of New Theory, 2021 Helical curves are constructed by the property that their unit tangents make a constant angle with a chosen constant direction. There are relations between polynomial planar curves, helices and Pythagorean-hodograph or shortly PH-curves.
Çetin Camcı +3 more
doaj +1 more source
A characterization of the four Chebyshev orthogonal families
International Journal of Mathematics and Mathematical Sciences, 2005 We obtain a property which characterizes the Chebyshev orthogonal polynomials of first, second, third, and fourth kind. Indeed, we prove that the four Chebyshev sequences are the unique classical orthogonal polynomial families such that their linear ...
E. Berriochoa +2 more
doaj +1 more source
Piecewise polynomial representations of genomic tracks. [PDF]
PLoS ONE, 2012 Genomic data from micro-array and sequencing projects consist of associations of measured values to chromosomal coordinates. These associations can be thought of as functions in one dimension and can thus be stored, analyzed, and interpreted as piecewise-
Maxime Tarabichi +2 more
doaj +1 more source
A Robust Adaptive One‐Sample‐Ahead Preview Super‐Twisting Sliding Mode Controller
International Journal of Adaptive Control and Signal Processing, EarlyView.Block Diagram of the Robust Adaptive One‐Sample‐Ahead Preview Super‐Twisting Sliding Mode Controller. ABSTRACT This article introduces a discrete‐time robust adaptive one‐sample‐ahead preview super‐twisting sliding mode controller. A stability analysis of the controller by Lyapunov criteria is developed to demonstrate its robustness in handling both ...
Guilherme Vieira Hollweg +5 more
wiley +1 more source