自动化与信息科学期刊
每年出版 12 期
ISSN 打印: 1064-2315
ISSN 在线: 2163-9337
SJR:
0.173
SNIP:
0.588
CiteScore™::
2
Indexed in
Admissible Approximation of Discrete Argument Functions and its Application to Data Compression
卷 31,
册 4-5, 1999,
pp. 98-112
DOI: 10.1615/JAutomatInfScien.v31.i4-5.320
Get access
摘要
The article considers the problem of approximation of functions of digital argument. The solution of this problem is reduced to determination of necessary and sufficient conditions of solvability of linear inequalities. These conditions are formulated in the form of a theorem defining the algorithms of their testing. Original mathematical results allow us to state the problem of data compression in terms of admissible approximations. Pilot software implementing the algorithm is described.
428 文章浏览量
2 文章下载
统计数据
相似内容的文章:
最新一期
Modeling of Configurations Formed when Using Microneedle Systems
Properties of Large Deviations of Empirical Estimates in a Stochastic Optimization Problem for a Homogeneous Random Field
The Dynamics of One Arms Race Mathematical Model with a Delay
Some Ways to Modeling Input Data for Information Search in the Library of Standards when Solving Semantics Problems
Method for Constructing Primitive Polynomials for Cryptographic Subsystems of Dependable Automated Systems
Complete Asymptotics of Approximations by Certain Singular Integrals in Mathematical Modeling
Index, Volume 52, 2020