Zobrazeno 1 - 10
of 123
pro vyhledávání: '"Abulaish, Muhammad"'
The subgraph isomorphism finding problem is a well-studied problem in the field of computer science and graph theory, and it aims to enumerate all instances of a query graph in the respective data graph. In this paper, we propose an efficient method,
Externí odkaz:
http://arxiv.org/abs/2312.02988
Vector-based word representations help countless Natural Language Processing (NLP) tasks capture the language's semantic and syntactic regularities. In this paper, we present the characteristics of existing word embedding approaches and analyze them
Externí odkaz:
http://arxiv.org/abs/2303.07196
Autor:
Sah, Amit Kumar, Abulaish, Muhammad
Publikováno v:
In Machine Learning with Applications September 2024 17
Autor:
Wasi, Nesar Ahmad, Abulaish, Muhammad
Publikováno v:
In Expert Systems With Applications 15 March 2024 238 Part D
Autor:
Abulaish, Muhammad, Jahiruddin
Publikováno v:
Muhammad Abulaish and Jahiruddin, A Novel Weighted Distance Measure for Multi-Attributed Graph, In Proceedings of the 10th Annual ACM India Conference (COMPUTE), Bhopal, India, Nov. 16-18, 2017, pp. 1-9
Due to exponential growth of complex data, graph structure has become increasingly important to model various entities and their interactions, with many interesting applications including, bioinformatics, social network analysis, etc. Depending on th
Externí odkaz:
http://arxiv.org/abs/1801.07150
Autor:
Sejwal, Vineet K., Abulaish, Muhammad
Publikováno v:
In Expert Systems With Applications 15 December 2022 209
Publikováno v:
Imaging Science Journal; Jun2024, Vol. 72 Issue 4, p466-478, 13p
Publikováno v:
In Journal of Biomedical Informatics December 2019 100
Publikováno v:
WIREs: Data Mining & Knowledge Discovery. Mar/Apr2024, Vol. 14 Issue 2, p1-25. 25p.
Publikováno v:
In Procedia Computer Science 2018 132:1002-1011