Zobrazeno 1 - 10
of 105
pro vyhledávání: '"Paplinski, A P"'
Encouraged by recent interest in traditional Chinese instruments this work proposes a computational sound synthesis model for a traditional Chinese instrument, the guzheng. Digital waveguide model and modal synthesis are the most popular physical mod
Externí odkaz:
http://arxiv.org/abs/1910.05447
In this paper, we propose a Dual Focal Loss (DFL) function, as a replacement for the standard cross entropy (CE) function to achieve a better treatment of the unbalanced classes in a dataset. Our DFL method is an improvement on the recently reported
Externí odkaz:
http://arxiv.org/abs/1909.11932
Medical imaging based prostate cancer diagnosis procedure uses intra-operative transrectal ultrasound (TRUS) imaging to visualize the prostate shape and location to collect tissue samples. Correct tissue sampling from prostate requires accurate prost
Externí odkaz:
http://arxiv.org/abs/1903.08814
This paper addresses the general problem of accurate identification of oil reservoirs. Recent improvements in well or borehole logging technology have resulted in an explosive amount of data available for processing. The traditional methods of analys
Externí odkaz:
http://arxiv.org/abs/1804.01675
Publikováno v:
In Neurocomputing 28 October 2021 462:69-87
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Aleksandr Cariow, Janusz P. Paplinski
Publikováno v:
Algorithms, Vol 14, Iss 11, p 309 (2021)
The article presents a parallel hardware-oriented algorithm designed to speed up the division of two octonions. The advantage of the proposed algorithm is that the number of real multiplications is halved as compared to the naive method for implement
Externí odkaz:
https://doaj.org/article/9eacef866ff6441c989a4f9d84f90002
Publikováno v:
Applied Sciences, Vol 11, Iss 17, p 8203 (2021)
This paper presents a new algorithm for multiplying two Kaluza numbers. Performing this operation directly requires 1024 real multiplications and 992 real additions. We presented in a previous paper an effective algorithm that can compute the same re
Externí odkaz:
https://doaj.org/article/32c7f8097e5247689d28845026ea141b
Autor:
Janusz P. Paplinski, Aleksandr Cariow
Publikováno v:
Applied Sciences, Vol 11, Iss 15, p 7007 (2021)
This article presents an efficient algorithm for computing a 10-point DFT. The proposed algorithm reduces the number of multiplications at the cost of a slight increase in the number of additions in comparison with the known algorithms. Using a 10-po
Externí odkaz:
https://doaj.org/article/69218619fe95470abdc677aec05a2d73
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.