Zobrazeno 1 - 10
of 91
pro vyhledávání: '"Al Naymat, Ghazi"'
Publikováno v:
Intelligent Systems Conference 2018
The exponential increase in the number of malicious threats on computer networks and Internet services due to a large number of attacks makes the network security at continuous risk. One of the most prevalent network attacks that threaten networks is
Externí odkaz:
http://arxiv.org/abs/1809.02611
Autor:
Sawalha, Samer, Al-Naymat, Ghazi
Publikováno v:
In Journal of King Saud University - Computer and Information Sciences October 2022 34(9):7803-7818
Autor:
Durrani, Usman Khan, Al Naymat, Ghazi, Ayoubi, Rami M., Kamal, Muhammad Mustafa, Hussain, Hanan
Publikováno v:
In The International Journal of Management Education March 2022 20(1)
Publikováno v:
Language Resources and Evaluation, 2020 Oct 01. 54(4), 921-941.
Externí odkaz:
https://www.jstor.org/stable/48740917
Publikováno v:
In Information Systems February 2021 96
Publikováno v:
Multimedia Tools & Applications; Aug2024, Vol. 83 Issue 26, p67825-67870, 46p
Autor:
Al-Naymat, Ghazi
Publikováno v:
International Conference on Computer Systems and Applications (AICCSA), pp.1,8. Fes, Morocco.27-30 May 2013
Recent research on pattern discovery has progressed from mining frequent patterns and sequences to mining structured patterns, such as trees and graphs. Graphs as general data structure can model complex relations among data with wide applications in
Externí odkaz:
http://arxiv.org/abs/1312.4477
Publikováno v:
Al-Naymat, G., S. Chawla, and J. Taheri, "SparseDTW: A Novel Approach to Speed up Dynamic Time Warping", The 2009 Australasian Data Mining, vol. 101, Melbourne, Australia, ACM Digital Library, pp. 117-127, 12/2009
We present a new space-efficient approach, (SparseDTW), to compute the Dynamic Time Warping (DTW) distance between two time series that always yields the optimal result. This is in contrast to other known approaches which typically sacrifice optimali
Externí odkaz:
http://arxiv.org/abs/1201.2969
Publikováno v:
In Digital Investigation March 2018 24:50-61
Publikováno v:
In Procedia Computer Science 2018 141:183-189