Zobrazeno 1 - 10
of 12
pro vyhledávání: '"Nidhi Purohit"'
Autor:
Atul Sharma, Arun Dhananjay Joshi, Nidhi Purohit, Shruti Sharma, Meenal Bhat, Maulik Chokshi, Tushar Mokashi, Arun Nair
Publikováno v:
Journal of Health Management. 24:43-61
Non-communicable diseases (NCDs) are a major health concern in India and were estimated to account for 63% of all deaths in 2016, and if left unaddressed, they could cost India approximately US$3.55 trillion in economic losses by 2030. The National P
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0e7fe02b07d05a08638d2e4e29173269
https://doi.org/10.1177/09720634221078717
https://doi.org/10.1177/09720634221078717
Autor:
Avinandan Das, Lawqueen Kanesh, Jayakrishnan Madathil, Komal Muluk, Nidhi Purohit, Saket Saurabh
Publikováno v:
Combinatorial Algorithms
A digraph D is singly connected if for all ordered pairs of vertices \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \se
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5f2a5caf2831b32bac641adf19f3a9c9
http://europepmc.org/articles/PMC7254902
http://europepmc.org/articles/PMC7254902
Publikováno v:
Computer Science – Theory and Applications ISBN: 9783031095733
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::19c4044d850ae3dada9fcca0a4a22d45
https://doi.org/10.1007/978-3-031-09574-0_7
https://doi.org/10.1007/978-3-031-09574-0_7
In the Categorical Clustering problem, we are given a set of vectors (matrix) A={a_1,\ldots,a_n} over \Sigma^m, where \Sigma is a finite alphabet, and integers k and B. The task is to partition A into k clusters such that the median objective of the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f1c0b66fe625568a980c3e69be43ab67
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030835071
WADS
WADS
In the Categorical Clustering problem, we are given a set of vectors (matrix) \(\mathbf {A}=\{\mathbf {a}_1,\ldots ,\mathbf {a}_n\}\) over \(\varSigma ^m\), where \(\varSigma \) is a finite alphabet, and integers k and B. The task is to partition \(\
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::379e637e3399143fe3ad220b041d52fe
https://doi.org/10.1007/978-3-030-83508-8_28
https://doi.org/10.1007/978-3-030-83508-8_28
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030489656
IWOCA
IWOCA
A digraph D is singly connected if for all ordered pairs of vertices \(u,v\in V(D)\), there is at most one path in D from u to v. In this paper, we study the Singly Connected Vertex Deletion (SCVD) problem: Given an n-vertex digraph D and a positive
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3dd8fc4d67b96db584932151355faea2
https://doi.org/10.1007/978-3-030-48966-3_18
https://doi.org/10.1007/978-3-030-48966-3_18
Autor:
Édouard Bonnet, Nidhi Purohit
Publikováno v:
IPEC 2019
IPEC 2019, Sep 2019, Munich, Germany
Algorithmica
IPEC 2019, Sep 2019, Munich, Germany
Algorithmica
A resolving set $S$ of a graph $G$ is a subset of its vertices such that no two vertices of $G$ have the same distance vector to $S$. The Metric Dimension problem asks for a resolving set of minimum size, and in its decision form, a resolving set of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a05f41c90d8597ea1b7851f22ab175fd
http://arxiv.org/abs/1907.08093
http://arxiv.org/abs/1907.08093
Publikováno v:
Frontiers in Algorithmics ISBN: 9783319784540
FAW
FAW
Motivated by an expensive computation performed by a computational topology software RIVET [9], Madkour et al. [1] introduced and studied the following graph partitioning problem. Given an edge weighted graph and an integer k, partition the vertex se
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::98e07e5b93e649ca8b21be1860d83243
https://doi.org/10.1007/978-3-319-78455-7_3
https://doi.org/10.1007/978-3-319-78455-7_3
Publikováno v:
Industrial Mathematics and Complex Systems ISBN: 9789811037573
In this paper, we have considered two models: SICRS model without and with single time delay in infective population. The global dynamics of both models have been carried out and the effect of carriers on transmission dynamics is discussed through th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ac1ca4c378e039a7ae557117d5d1c2c7
https://doi.org/10.1007/978-981-10-3758-0_24
https://doi.org/10.1007/978-981-10-3758-0_24
Autor:
Nidhi Purohit, Shikha Bathla
Publikováno v:
2016 2nd International Conference on Next Generation Computing Technologies (NGCT).
In this paper a High Speed and Low Power 4-Bit Multiplier using FinFET technology at 32nm is proposed. Comparative analysis of MOSFET based and FinFET based multiplier is done using HSPICE tool. FinFET is found to be less power consuming than MOSFET
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::dbb490c0dd547906ee7e5c10dd7deb87
https://doi.org/10.1109/ngct.2016.7877390
https://doi.org/10.1109/ngct.2016.7877390