Results 41 to 50 of about 343,275 (168)
Calibrating Bayesian inference
British Journal of Mathematical and Statistical Psychology, EarlyView.Abstract Bayesian statistics has gained popularity in psychological research due to its intuitive uncertainty quantification and convenient information‐updating rules. In many applications, however, prior distributions are introduced merely as instruments to facilitate computation, rather than as representations of genuine subjective belief ...
Yang Liu +2 more
wiley +1 more source
Boundedness of a Kantorovich type of the Szász-Mirakjan Operator [PDF]
ITM Web of ConferencesLet 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
Computer Graphics Forum, EarlyView.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
Bernstein form of a polynomial
, 1966 Let P denote a polynomial with real coefficients. In this paper we devise an algorithm for determining upper and lower bounds for the set {P(x) : 0
Cargo, G.T.; Shisha, O
core +1 more source
Register‐Efficient Linear‐Time Evaluation in the Bernstein Basis
Computer Graphics Forum, EarlyView.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
Polynomial Multiplication in NTRU Prime
Transactions on Cryptographic Hardware and Embedded Systems, 2020 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
Parallel Vectors Extraction using Bézier Clipping
Computer Graphics Forum, EarlyView.Abstract In this paper, we propose a novel local feature extraction algorithm for the parallel vectors (PV) operator. Our method is based on Bézier clipping, which is a bracketing‐based root finding method that is commonly‐used in computer‐aided geometric design.
Nico Daßler, Tobias Günther
wiley +1 more source
t‐Regina: Data‐driven Authoring of Free‐form Registration for Cartoon Character Sprites
Computer Graphics Forum, EarlyView.Abstract This paper proposes t‐Regina, a novel iterative scheme that automates the manipulation of grid handles in free‐form deformation (FFD) for deformable registrations of cartoon character sprites. First, we build a data‐driven FFD (dFFD) that enables users to handle locations of FFD handles from lower‐dimensional parameters.
Tsukasa Fukusato, Akinobu Maejima
wiley +1 more source
A Bernstein Polynomial Approach to Estimating Reachable Set of Periodic Piecewise Polynomial Systems
, 2020 In this paper, a Bernstein polynomial approach is first applied to the estimation of reachable set for a class of periodic piecewise polynomial systems (PPPSs), whose subsystems are time-varying and can be expanded to Bernstein polynomial forms.
Xie, X, Fan, C, Kwok, KW, Lam, J
core +1 more source
Sparse polynomial interpolation with Bernstein polynomials
, 2021 We present an algorithm for interpolating an unknown univariate polynomial f that has a t sparse representation (t
İmamoğlu, Erdal
core +1 more source