Journal of Automation and Information Sciences
Publicou 12 edições por ano
ISSN Imprimir: 1064-2315
ISSN On-line: 2163-9337
SJR:
0.173
SNIP:
0.588
CiteScore™::
2
Indexed in
On Construction of Algorithms with the Bounded Parallelism for Solving Problems of Digital Filtering
Volume 34,
Edição 12, 2002,
10 pages
DOI: 10.1615/JAutomatInfScien.v34.i12.20
RESUMO
We propose the algorithm with the bounded number of branches executed in parallel for numerical solving the two- and three-dimensional problems of digital filtering. Estimations of acceleration of these parallel algorithms are given.
666 Visualizações do artigo
2 downloads de artigos
Métricas
Artigos com conteúdo semelhante:
Última edição
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