Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Yasser Elmi sola"'
Publikováno v:
مهندسی مخابرات جنوب, Vol 13, Iss 50, Pp 85-100 (2024)
IoT-based devices are constantly sending data to the cloud. However, the centralization of cloud data centers and the long distance to the location of data sources has reduced the efficiency of this paradigm in real-time applications. Fog computing c
Externí odkaz:
https://doaj.org/article/3b89016bffda4f24bbc898a977c73c48
Publikováno v:
Journal of King Saud University: Computer and Information Sciences, Vol 35, Iss 1, Pp 368-381 (2023)
The number of Internet of Things (IoT)-based applications is constantly increasing, and transferring all their associated data to a remote centralized cloud requires more latency, energy, bandwidth, and cost. In such cases, the fog layer as a new com
Externí odkaz:
https://doaj.org/article/b1b5b44610574838b5f6a0df318b198f
Publikováno v:
The Journal of Supercomputing.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a3f4b5b80b14828ef33071ce2c9ce027
https://doi.org/10.1007/s11227-023-05172-9
https://doi.org/10.1007/s11227-023-05172-9
Publikováno v:
Signal Processing. 154:250-259
In this paper, a blind deblurring algorithm that is well converged towards the latent sharp image and the blur PSF is proposed. The proposed algorithm employs our recently proposed ringing suppression regularizer in a solution to the blind deblurring
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::dfd60fa2350552fe004ea7bc5fce0f6f
https://doi.org/10.1016/j.sigpro.2018.09.015
https://doi.org/10.1016/j.sigpro.2018.09.015
Publikováno v:
IEEE Transactions on Image Processing. 27:580-593
In this paper, we present a simple yet effective image deblurring method to produce ringing-free deblurred images. Our work is inspired by the observation that large-scale deblurring ringing artifacts are measurable through a multi-resolution pyramid
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8ba4eea99a189b6424723c956acde866
https://doi.org/10.1109/tip.2017.2764625
https://doi.org/10.1109/tip.2017.2764625
Publikováno v:
2009 2nd IEEE International Conference on Computer Science and Information Technology.
DCUR follows the same procedure as define in Bellman-Ford but uses two vectors, namely Least Cost and Least Delay vector. The main drawback of DCUR is its assumption of link costs. It means that the minimum cost path is more often chosen and therefor
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ab01efa8ae2f8288fc99b555df2fdccd
https://doi.org/10.1109/iccsit.2009.5234747
https://doi.org/10.1109/iccsit.2009.5234747