Zobrazeno 1 - 10
of 1 219
pro vyhledávání: '"P. Subashini"'
Autor:
M.B. Jennyfer Susan, P. Subashini
Publikováno v:
Measurement: Sensors, Vol 27, Iss , Pp 100788- (2023)
Smart Colposcopy is a low-cost and highly effective screening device used to detect cervical cancer. However, the captured images can be significantly affected by specular reflection, resulting in reduced accuracy during the grading process. In this
Externí odkaz:
https://doaj.org/article/214ed38619754704b23b0657ea7e784e
Autor:
Mugambikai Magendiran, Geeta Appannah, Nor Aishah Emi, Yit Siew Chin, Zalilah Mohd Shariff, Azriyanti Anuar Zaini, Nurainul Hana Shamsuddin, Subapriya Suppiah, Suraini Mohamad Saini, Subashini C. Thambiah, Siew Mooi Ching
Publikováno v:
Nutrition & Metabolism, Vol 21, Iss 1, Pp 1-11 (2024)
Abstract Background Little is known on the prospective associations between an empirically derived dietary pattern (DP) and life satisfaction among adolescents. This PUTRA-Adol follow-up study aimed to assess the prospective associations between the
Externí odkaz:
https://doaj.org/article/5c0a330d7b574785a8e921aa43ecfc67
Publikováno v:
Kerala Journal of Ophthalmology, Vol 36, Iss 2, Pp 143-151 (2024)
Purpose: Diabetic retinopathy (DR) is a multifactorial disease. The objective of the current study was to evaluate the systemic risk factors for diabetic retinopathy in patients with type 2 DM in a South Indian Cohort. Materials and Methods: Design:
Externí odkaz:
https://doaj.org/article/a906b68f71bc4973a05ad9c99ed4e128
Publikováno v:
Indian Journal of Ophthalmology, Vol 72, Iss Suppl 4, Pp S541-S541 (2024)
Externí odkaz:
https://doaj.org/article/20da6f6421e14bb281680f79bcb3a6ee
We investigate the parameterized complexity of Maximum Exposure Problem (MEP). Given a range space (R, P) where R is the set of ranges containing a set P of points, and an integer k, MEP asks for k ranges which on removal results in the maximum numbe
Externí odkaz:
http://arxiv.org/abs/2203.11114
For a graph property $\Pi$, Subgraph Complementation to $\Pi$ is the problem to find whether there is a subset $S$ of vertices of the input graph $G$ such that modifying $G$ by complementing the subgraph induced by $S$ results in a graph satisfying t
Externí odkaz:
http://arxiv.org/abs/2202.13620
For a class $\mathcal{G}$ of graphs, the problem SUBGRAPH COMPLEMENT TO $\mathcal{G}$ asks whether one can find a subset $S$ of vertices of the input graph $G$ such that complementing the subgraph induced by $S$ in $G$ results in a graph in $\mathcal
Externí odkaz:
http://arxiv.org/abs/2103.02936
The $r$-th iterated line graph $L^{r}(G)$ of a graph $G$ is defined by: (i) $L^{0}(G) = G$ and (ii) $L^{r}(G) = L(L^{(r- 1)}(G))$ for $r > 0$, where $L(G)$ denotes the line graph of $G$. The Hamiltonian Index $h(G)$ of $G$ is the smallest $r$ such th
Externí odkaz:
http://arxiv.org/abs/1912.01990
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.