Zobrazeno 1 - 10
of 1 329
pro vyhledávání: '"Khan, Shahbaz"'
Autor:
Khatoon, Arifa, Aslam, Reema, Bilal, Shabnam, Naz, Sadia, Zaffar, Farhan, Khan, Shahbaz Ahmed, Ramzan, Rao Muhammad, Noreen, Saima, Phoolzaib, Kiran, Batool, Zahra, Saleem, Kahsma, Rasheed, Saba
Publikováno v:
GMS Hygiene and Infection Control, Vol 18, p Doc09 (2023)
Introduction: SARS-CoV-2 has created a significant challenge to healthcare systems, since the disease has spread rapidly, outweighing hospital capacity and exposing Health Care Workers (HCWs) to the risk of infection. The main objective of this study
Externí odkaz:
https://doaj.org/article/08558fce749e4ee392f896ec854effd0
Autor:
Bhagavan, Kancharla Nikhilesh, Vardhan, Macharla Sri, Chowdary, Madamanchi Ashok, Khan, Shahbaz
Depth first search is a fundamental graph problem having a wide range of applications. For a graph $G=(V,E)$ having $n$ vertices and $m$ edges, the DFS tree can be computed in $O(m+n)$ using $O(m)$ space where $m=O(n^2)$. In the streaming environment
Externí odkaz:
http://arxiv.org/abs/2406.03922
Autor:
Khan, Shahbaz, Sarkar, Satyajit, Lawler, Nicolas B., Akbar, Ali, Anwar, Muhammad Sabieh, Martyniuk, Mariusz, Iyer, K. Swaminathan, Kostylev, Mikhail
In this work, we investigate the effects of H2 on the physical properties of Fe25Pd75. Broadband ferromagnetic resonance (FMR) spectroscopy revealed a significant FMR peak shift induced by H2 absorption for the FCC phased Fe25Pd75. The peak shifted t
Externí odkaz:
http://arxiv.org/abs/2405.07753
Genome assembly is a prominent problem studied in bioinformatics, which computes the source string using a set of its overlapping substrings. Classically, genome assembly uses assembly graphs built using this set of substrings to compute the source s
Externí odkaz:
http://arxiv.org/abs/2402.13920
Publikováno v:
Benchmarking: An International Journal, 2023, Vol. 31, Issue 3, pp. 920-954.
Externí odkaz:
http://www.emeraldinsight.com/doi/10.1108/BIJ-01-2023-0039
For real-world applications of machine learning (ML), it is essential that models make predictions based on well-generalizing features rather than spurious correlations in the data. The identification of such spurious correlations, also known as shor
Externí odkaz:
http://arxiv.org/abs/2302.04246
Autor:
Cairo, Massimo, Khan, Shahbaz, Rizzi, Romeo, Schmidt, Sebastian, Tomescu, Alexandru I., Zirondelli, Elia C.
In a strongly connected graph $G = (V,E)$, a cut arc (also called strong bridge) is an arc $e \in E$ whose removal makes the graph no longer strongly connected. Equivalently, there exist $u,v \in V$, such that all $u$-$v$ walks contain $e$. Cut arcs
Externí odkaz:
http://arxiv.org/abs/2210.07530
Publikováno v:
British Food Journal, 2023, Vol. 126, Issue 2, pp. 578-594.
Externí odkaz:
http://www.emeraldinsight.com/doi/10.1108/BFJ-04-2023-0307
Publikováno v:
Benchmarking: An International Journal, 2022, Vol. 30, Issue 10, pp. 3753-3790.
Externí odkaz:
http://www.emeraldinsight.com/doi/10.1108/BIJ-01-2021-0017
Autor:
Cáceres, Manuel, Cairo, Massimo, Grigorjew, Andreas, Khan, Shahbaz, Mumey, Brendan, Rizzi, Romeo, Tomescu, Alexandru I., Williams, Lucia
Minimum flow decomposition (MFD) is the NP-hard problem of finding a smallest decomposition of a network flow/circulation $X$ on a directed graph $G$ into weighted source-to-sink paths whose superposition equals $X$. We show that, for acyclic graphs,
Externí odkaz:
http://arxiv.org/abs/2207.02136