Zobrazeno 1 - 10
of 2 218
pro vyhledávání: '"S KARTHIK"'
Autor:
RAFEEQUE R ALYETHODI, JAI SUNDER, S KARTHIK, P PERUMAL, K MUNISWAMY, T SUJATHA, BHATTACHARYA D
Publikováno v:
Indian Journal of Animal Sciences, Vol 93, Iss 11 (2023)
The present study was carried out to assess the effect of rearing systems, breeds, number of pregnancies, and frequency of multiple births on physiological oxidative stress markers (OSMs) in indigenous goat breeds of Andaman and Nicobar Islands, Indi
Externí odkaz:
https://doaj.org/article/8c1cd94338294a3ea6fe5505d2a68e7a
Autor:
E Poovannan, S Karthik
Publikováno v:
Applied Artificial Intelligence, Vol 36, Iss 1 (2022)
In today’s world, people need sleeker devices with better functionality and longer battery life. This can be achieved by integrating more components onto smaller chips, resulting in a shift to low-geometry chip design. However, power dissipation du
Externí odkaz:
https://doaj.org/article/948491783ee7493898470876de37aa35
Parameterized Inapproximability Hypothesis (PIH) is a central question in the field of parameterized complexity. PIH asserts that given as input a 2-CSP on $k$ variables and alphabet size $n$, it is W[1]-hard parameterized by $k$ to distinguish if th
Externí odkaz:
http://arxiv.org/abs/2407.08917
Autor:
RAFEEQUE R ALYETHODI, AJAYVIR SINGH SIROHI, S KARTHIK, S TYAGI, ANKUR SHARMA, P PERUMAL, JAI SUNDER, D BHATTACHARYA
Publikováno v:
Indian Journal of Animal Sciences, Vol 92, Iss 1 (2022)
The present study aimed to measure and comparealkaline phosphatase (ALP) enzyme activity in the bull’ssemen with varying freezability. Based on the post-thawmotility percentages, the bulls of similar age groups weregrouped into good and low fr
Externí odkaz:
https://doaj.org/article/2b01f2f6bc094c539a362a0833af60ac
In the Euclidean $k$-means problems we are given as input a set of $n$ points in $\mathbb{R}^d$ and the goal is to find a set of $k$ points $C\subseteq \mathbb{R}^d$, so as to minimize the sum of the squared Euclidean distances from each point in $P$
Externí odkaz:
http://arxiv.org/abs/2405.13877
Autor:
Bhattacharjee, Bishwaranjan, Trivedi, Aashka, Muraoka, Masayasu, Ramasubramanian, Muthukumaran, Udagawa, Takuma, Gurung, Iksha, Pantha, Nishan, Zhang, Rong, Dandala, Bharath, Ramachandran, Rahul, Maskey, Manil, Bugbee, Kaylin, Little, Mike, Fancher, Elizabeth, Gerasimov, Irina, Mehrabian, Armin, Sanders, Lauren, Costes, Sylvain, Blanco-Cuaresma, Sergi, Lockhart, Kelly, Allen, Thomas, Grezes, Felix, Ansdell, Megan, Accomazzi, Alberto, El-Kurdi, Yousef, Wertheimer, Davis, Pfitzmann, Birgit, Ramis, Cesar Berrospi, Dolfi, Michele, de Lima, Rafael Teixeira, Vagenas, Panagiotis, Mukkavilli, S. Karthik, Staar, Peter, Vahidinia, Sanaz, McGranaghan, Ryan, Lee, Tsendgar
Large language models (LLMs) trained on general domain corpora showed remarkable results on natural language processing (NLP) tasks. However, previous research demonstrated LLMs trained using domain-focused corpora perform better on specialized tasks
Externí odkaz:
http://arxiv.org/abs/2405.10725
Autor:
S., Karthik C., Rahul, Saladi
In this work, we present a plethora of results for the range longest increasing subsequence problem (Range-LIS) and its variants. The input to Range-LIS is a sequence $\mathcal{S}$ of $n$ real numbers and a collection $\mathcal{Q}$ of $m$ query range
Externí odkaz:
http://arxiv.org/abs/2404.04795
Publikováno v:
International Journal of Advanced Medical and Health Research, Vol 5, Iss 1, Pp 14-17 (2018)
Background: The 10-item CONFbal scale is a measure used to assess balance confidence in geriatric population. However, its measurement properties have not been studied in the poststroke population. Objectives: The objective of this study was to asses
Externí odkaz:
https://doaj.org/article/00d3400453a74c43b799bb74e89c2d7b
The Ulam distance of two permutations on $[n]$ is $n$ minus the length of their longest common subsequence. In this paper, we show that for every $\varepsilon>0$, there exists some $\alpha>0$, and an infinite set $\Gamma\subseteq \mathbb{N}$, such th
Externí odkaz:
http://arxiv.org/abs/2401.17235
On Inapproximability of Reconfiguration Problems: PSPACE-Hardness and some Tight NP-Hardness Results
Autor:
S., Karthik C., Manurangsi, Pasin
The field of combinatorial reconfiguration studies search problems with a focus on transforming one feasible solution into another. Recently, Ohsaka [STACS'23] put forth the Reconfiguration Inapproximability Hypothesis (RIH), which roughly asserts th
Externí odkaz:
http://arxiv.org/abs/2312.17140