Results 51 to 60 of about 43,913 (238)
Neural Network Repair With Shapley‐Guided Search
ABSTRACT The deployment of deep neural networks (DNNs) in safety‐critical domains is critically hampered by their vulnerability to defects, which can arise from malicious attacks or low‐quality data. Therefore, precisely locating the network components responsible for these defects, and subsequently repairing them without compromising overall model ...
Xiaofu Du +4 more
wiley +1 more source
Boundedness of a Kantorovich type of the Szász-Mirakjan Operator [PDF]
Let Bn f represent the n-th Bernstein polynomial for f for each n ϵ ℕ and f ϵ C ([0, 1]) . Then for any f ϵ C ([0, 1]), the sequence {Bn f} converges uniformly to f.
Neswan Oki +3 more
doaj +1 more source
Basis Networks: Learning basis functions for free‐form triangulations
Abstract We present a framework for learning compactly supported basis functions that define tangent continuous surfaces based on coarse irregular triangle meshes. The basis functions are represented as MLPs. Smoothness of the basis functions is achieved by using the values of Loop basis functions as the parameterization of the surface.
T. Djuren, M. Alexa
wiley +1 more source
Register‐Efficient Linear‐Time Evaluation in the Bernstein Basis
Abstract We investigate the evaluation of points and derivatives of Bézier curves and surfaces on modern architectures, focusing on performance and guided by numerical error bounds. While the de Casteljau algorithm remains the reference for numerical robustness, its linear working‐set size imposes substantial register pressure on GPUs.
Gábor Valasek, Anna Lili Horváth
wiley +1 more source
Generalized Bernstein-Chlodowsky Polynomials
For given positive integers \(n\) and \(m\), the generalization of Bernstein-Chlodowsky polynomials is defined by \[ B_{n,m}(f,x)= \Biggl( 1+(m-1) \frac{x}{b_n} \Biggr) \sum_{k=0}^{[n/m]} f\Biggl( \frac{b_nk} {n-(m-1)k}\Biggr) C_{n-(m-1)k}^k \Biggl( \frac{x}{b_n} \Biggr)^k \Biggl(1- \frac{x}{b_n} \Biggr)^{n-mk}, \] where \(b_n\) is a sequence of ...
Gadjiev, A.D. +2 more
openaire +3 more sources
Goodness‐of‐Fit Tests for Positive Quadrant Dependence
Summary When two random variables are positive quadrant dependent (PQD), they are more likely to assume small (or large) values simultaneously compared with when the random variables are independent. This dependence structure is of interest in many areas, including finance, actuarial science and engineering.
Chuan‐Fa Tang, Joshua M. Tebbs
wiley +1 more source
Starting from the one-parameter dependent linear polynomial Stancu operator, we consider the related polynomial curve scheme with one scalar shape parameter.
Adalbert Csaba Hatvany
doaj +2 more sources
Polynomial Multiplication in NTRU Prime
This paper proposes two different methods to perform NTT-based polynomial multiplication in polynomial rings that do not naturally support such a multiplication. We demonstrate these methods on the NTRU Prime key-encapsulation mechanism (KEM) proposed by
Erdem Alkim +10 more
doaj +3 more sources
The approximation of localized Bernstein polynomials
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Linsen Xie, Tingfan Xie
openaire +2 more sources
Background Support for violent and non‐violent radicalization co‐exists in some, but not all, adolescents. Yet, little is known about how adolescents transition towards or away from violent and/or non‐violent radicalization over time. Within a socio‐ecological framework, this study investigates how Canadian adolescents move from profiles that support ...
Diana Miconi +3 more
wiley +1 more source

