Results 11 to 20 of about 635,053 (187)
Re-encoding reformulation and application to Welch-Berlekamp algorithm [PDF]
The main decoding algorithms for Reed-Solomon codes are based on a bivariate interpolation step, which is expensive in time complexity. Lot of interpolation methods were proposed in order to decrease the complexity of this procedure, but they stay still ...
Barbier, Morgan
core +2 more sources
Interpolation in Normal Extensions of the Brouwer Logic [PDF]
The Craig interpolation property and interpolation property for deducibility are considered for special kind of normal extensions of the Brouwer ...
Kostrzycka, Zofia
core +1 more source
In the present paper we will introduce a new approach to multivariate interpolation by employing polyharmonic functions as interpolants, i.e. by solutions of higher order elliptic equations. We assume that the data arise from $C^{\infty}$ or analytic functions in the ball $B_{R}.$ We prove two main results on the interpolation of $C^{\infty}$ or ...
Werner Haußmann, Ognyan Kounchev
openaire +3 more sources
Given a set of snapshots from a temporal network we develop, analyze, and experimentally validate a so-called network interpolation scheme. Our method allows us to build a plausible, albeit random, sequence of graphs that transition between any two given graphs.
Thomas Reeves+2 more
openaire +2 more sources
To Interpolate or not to Interpolate
Short research paper, accepted at ...
Li, Hang+6 more
openaire +2 more sources
Interpolation of Morrey-Campanato and Related Smoothness Spaces [PDF]
In this article, the authors study the interpolation of Morrey-Campanato spaces and some smoothness spaces based on Morrey spaces, e.\,g., Besov-type and Triebel-Lizorkin-type spaces. Various interpolation methods, including the complex method, the $\pm$-
Sickel, Winfried+2 more
core +1 more source
Revisit Sparse Polynomial Interpolation based on Randomized Kronecker Substitution
In this paper, a new reduction based interpolation algorithm for black-box multivariate polynomials over finite fields is given. The method is based on two main ingredients.
A Arnold+17 more
core +1 more source
Generalization of the Kimeldorf-Wahba correspondence for constrained interpolation [PDF]
In this paper, we extend the correspondence between Bayes' estimation and optimal interpolation in a Reproducing Kernel Hilbert Space (RKHS) to the case of linear inequality constraints such as boundedness, monotonicity or convexity. In the unconstrained
Bay, Xavier+2 more
core +7 more sources
On interpolation of interpolating sequences
AbstractLet A be a uniform algebra on the compact space X and σ a probability measure on X. We define the Hardy spaces HP(σ) and the HP(σ) interpolating sequences S in the p-spectrum Mp of σ. Under some structural hypotheses on (A, σ), we prove that if a sequence S ⊂ Mp is HP(σ) interpolating, then it is Hs(σ) interpolating for s < p.
openaire +3 more sources