Zobrazeno 1 - 10
of 18
pro vyhledávání: '"Jalal Khalil"'
Publikováno v:
Future Transportation, Vol 3, Iss 2, Pp 519-534 (2023)
Transportation Network Companies (TNCs) use online-enabled apps to provide on-demand transportation services. TNCs facilitate travelers to connect with drivers that can offer them rides for compensation using driver-owned vehicles. The ride requests
Externí odkaz:
https://doaj.org/article/59b3236e99914ed390d6a2cd299dcd55
Autor:
Ziad Jalal Khalil Aldammagh
Publikováno v:
المجلة العربية لضمان جودة التعليم الجامعي, Vol 14, Iss 47, Pp 73-100 (2021)
The study aimed to identify the governance standards and requirements in private Palestinian universities in light of the requirements for accreditation, quality and Palestinian classification of universities from the point of view of their employees
Externí odkaz:
https://doaj.org/article/c6b099056e3a4332a043a9149c2c04cc
Autor:
null Furat Salman, null Virginia P. Sisiopiku, null Jalal Khalil, null Mostafa Jafarzadehfadaki, null Da Yan
Publikováno v:
Journal of Traffic and Transportation Engineering. 11
Publikováno v:
Journal of Transportation Technologies. 12:59-79
Publikováno v:
The VLDB Journal. 31:649-674
Given a user-specified minimum degree threshold $$\gamma $$ , a $$\gamma $$ -quasi-clique is a subgraph where each vertex connects to at least $$\gamma $$ fraction of the other vertices. Quasi-clique is a natural definition for dense structures, so f
Autor:
Saugat Adhikari, Da Yan, Mirza Tanzim Sami, Jalal Khalil, Lyuheng Yuan, Bhadhan Roy Joy, Zhe Jiang, Arpan Man Sainju
Publikováno v:
Proceedings of the 30th International Conference on Advances in Geographic Information Systems.
Autor:
Jalal Khalil, Da Yan, Lyuheng Yuan, Mostafa Jafarzadehfadaki, Saugat Adhikari, Virginia P. Sisiopiku, Zhe Jiang
Publikováno v:
Proceedings of the 30th International Conference on Advances in Geographic Information Systems.
Publikováno v:
The VLDB Journal. 31:287-320
Finding from a big graph those subgraphs that satisfy certain conditions is useful in many applications such as community detection and subgraph matching. These problems have a high time complexity, but existing systems that attempt to scale them are
Publikováno v:
2022 IEEE 38th International Conference on Data Engineering (ICDE).
Publikováno v:
2021 IEEE International Conference on Big Data (Big Data).