A characterization is presented of the class of stationary processes that have polynomial covariance functions of degree less than or equal to 4 on an interval. The results extend to isotropic random ...
The paper discusses both theoretical properties and practical implementation of product integration rules of the form $$\int^\infty_{-\infty} k(x)f(x) dx \approx \sum ...
Algorithmic complexity, a cornerstone of theoretical computer science, examines the intrinsic resource requirements of computational problems and the limits of what can be efficiently computed. Within ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results
Feedback