Zobrazeno 1 - 10
of 73
pro vyhledávání: '"Mohammed, Haddad"'
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol vol. 25:3 special issue..., Iss Special issues (2024)
Inspired by the split decomposition of graphs and rank-width, we introduce the notion of $r$-splits. We focus on the family of $r$-splits of a graph of order $n$, and we prove that it forms a hypergraph with several properties. We prove that such hyp
Externí odkaz:
https://doaj.org/article/c34320a252c24d9697b5e8d4345e23ca
Publikováno v:
Procedia Computer Science. 220:632-638
Publikováno v:
Neural Computing and Applications. 35:7035-7048
Autor:
Saleh Ngaski Garba, Abdullahi Haruna Ibrahim, Mahfuz Mohammed Haddad, Emmanuel Ejembi Anyebe, Faruk Umar Abubakar, Farida Shehu
Publikováno v:
INTERNATIONAL JOURNAL OF SCIENTIFIC RESEARCH. :31-34
Vesico-vaginal stula (VVF) is the commonest urogenital stula in Sub-Saharan Africa. The psychological consequences of the condition though neglected may be more devastating than the physical injuries. The study aims to assess the levels and ass
Autor:
Basheer, Abdulrahman, Ahmed, Mady, Mohammad Al, Odat, Ashraf Al, Tayar, Muhammad Asim, Rana, Abdulrahman, Alharthy, Alyaa, Alhazmi, Ahmed S, Abdelmoaty, Muhammad Mansoor, Hafeez, Ahmed, Kuhail, Alfateh M, Noor, Mohammed, Haddad, Anas, Mady, Noor, Ali, Huda, Mhawish, Waleed, Aletreby
Publikováno v:
Journal of Ayub Medical College Abbottabad. 34:397-402
Background: Corona virus disease is caused by the enveloped, single stranded RNA virus known as severe acute respiratory syndrome coronavirus 2 (SARS-CoV-2) becoming the deadliest disease of the century. Its global outbreak has led researchers to dev
Identity2Vec: learning mesoscopic structural identity representations via Poisson probability metric
Publikováno v:
International Journal of Data Science and Analytics.
Graph Convolutional Networks (GCNs) are a subcategory of neural networks that can take a graph as input. They have been solicited lately due to their success and the ubiquity of data that can be represented as graphs. However, handling large graphs h
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5c1c5d856eb56c96c6fe682883337acc
https://doi.org/10.21203/rs.3.rs-2648725/v1
https://doi.org/10.21203/rs.3.rs-2648725/v1
Autor:
Mohammed HADDAD
Publikováno v:
2022 2nd International Conference on Advanced Electrical Engineering (ICAEE).
Publikováno v:
Database and Expert Systems Applications. DEXA 2022
Database and Expert Systems Applications. DEXA 2022, Aug 2022, Vienne, Austria. pp.310-315, ⟨10.1007/978-3-031-12426-6_29⟩
Lecture Notes in Computer Science ISBN: 9783031124259
Database and Expert Systems Applications. DEXA 2022, Aug 2022, Vienne, Austria. pp.310-315, ⟨10.1007/978-3-031-12426-6_29⟩
Lecture Notes in Computer Science ISBN: 9783031124259
International audience; Several graph summarization approaches aggregate dense sub-graphs into super-nodes leading to a compact summary of the input graph. The main issue for these approaches is how to achieve a high compression rate while retaining
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9d36b0111b035327136377a2d5112040
https://hal.science/hal-03762142/document
https://hal.science/hal-03762142/document