Comparative Analysis of Computational Complexity of Fast Matrix Multiplication Algorithms
Matrix multiplication is a commonly used operation in various graphics, imaging, robotics, and signal processing applications. In connection with the increase in the growth of the characteristics of digital information, it is necessary to improve the algorithms for processing information and the eff...
Guardat en:
Autors principals: | Abdulsalyamova, A. S., Абдулсалямова, А. Ш., Kalita, D. I., Калита, Д. И., Lyakhov, P. A., Ляхов, П. А., Nagornov, N. N., Нагорнов, Н. Н., Bergerman, M. V., Бергерман, М. В. |
---|---|
Format: | Статья |
Idioma: | English |
Publicat: |
2024
|
Matèries: | |
Accés en línia: | https://dspace.ncfu.ru/handle/20.500.12258/26635 |
Etiquetes: |
Afegir etiqueta
Sense etiquetes, Sigues el primer a etiquetar aquest registre!
|
Ítems similars
-
A Comparative Study of Secure Outsourced Matrix Multiplication Based on Homomorphic Encryption
per: Babenko, M. G., et al.
Publicat: (2023) -
Reducing the Computational Complexity of Image Processing Using Wavelet Transform Based on the Winograd Method
per: Lyakhov, P. A., et al.
Publicat: (2023) -
Development of digital image processing algorithms based on the Winograd method in general form and analysis of their computational complexity
per: Lyakhov, P. A., et al.
Publicat: (2023) -
On the algorithmic complexity of digital image processing filters with winograd calculations
per: Lyakhov, P. A., et al.
Publicat: (2022) -
Comparative Analysis of Various Methods to Circuit Design for DWT with CDF 9/7 Wavelet
per: Nagornov, N. N., et al.
Publicat: (2022)