Zobrazeno 1 - 10
of 157
pro vyhledávání: '"C, Gayathri"'
Autor:
Sen, Mrinmay, Qin, A. K., C, Gayathri, N, Raghu Kishore, Chen, Yen-Wei, Raman, Balasubramanian
This paper introduces a new stochastic optimization method based on the regularized Fisher information matrix (FIM), named SOFIM, which can efficiently utilize the FIM to approximate the Hessian matrix for finding Newton's gradient update in large-sc
Externí odkaz:
http://arxiv.org/abs/2403.02833
Autor:
Vaish Rohit, Al-Shaikh Sadiq M., Kumar Shah Sanjeev, C Gayathri, Dhabliya Dharmesh, Vimala Devi R.
Publikováno v:
E3S Web of Conferences, Vol 540, p 13012 (2024)
In the modern agricultural landscape, the surge in demand for organic farming accentuates the imperative of continuous plant health monitoring. This becomes even more paramount when ensuring both the quality and quantity of produce. Crop devastation
Externí odkaz:
https://doaj.org/article/6a68672090be48feae3629216768facb
Autor:
C. Gayathri, B. Keerthana, D. Jahnavi, C.V. Monika, G. Srilakshmi, B. Sangeetha Lakshmi, P. Lakshmi Aishwarya, R. Ram, V. Siva Kumar
Publikováno v:
Indian Journal of Clinical Medicine. 12:28-31
Serum phosphate level reference range in adults is 2.5 mg/dL to 4.5 mg/dL and in children is 3 mg/dL to 6 mg/dL. The causes of hyperphosphatemia fall into four categories. These are decreased renal excretion of phosphorus, exogenous phosphorus admini
Autor:
C. Gayathri, K. Monica, P. Aishwarya Lakshmi, S. Mathini, N. Prasanna Kumar, null Ram, V. Siva Kumar
Publikováno v:
Clinical Rheumatology.
Publikováno v:
2023 Second International Conference on Electronics and Renewable Systems (ICEARS).
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.
Autor:
K. C., Gayathri, Subramanian, Shenbaga Sundaram, Mohan, Sangeetha, Altaim, Thamer A., Thanigachalam, Kumaran, Elgendy, Salwa Roushdy, Eswaramoorthi, Vijayamurugan, Saicheethra, P., Senthil, Gaowgzeh, Riziq Allah
Publikováno v:
Fizjoterapia Polska; 2023, Issue 5, p281-285, 5p
Publikováno v:
Discrete Mathematics, Algorithms and Applications.
A nonempty set [Formula: see text] of a graph [Formula: see text] is an open packing set of [Formula: see text] if no two vertices of [Formula: see text] have a common neighbor in [Formula: see text]. The maximum cardinality of an open packing set is
Publikováno v:
International Journal of Pharmaceutical Research (09752366). 2020 Supplement1, p3215-3221. 7p.
Publikováno v:
International Journal of Pharmaceutical Research (09752366). 2020 Supplement1, p3209-3214. 6p.