Zobrazeno 1 - 10
of 547
pro vyhledávání: '"KUMAR, GUNJAN"'
Equivalence testing, a fundamental problem in the field of distribution testing, seeks to infer if two unknown distributions on $[n]$ are the same or far apart in the total variation distance. Conditional sampling has emerged as a powerful query mode
Externí odkaz:
http://arxiv.org/abs/2403.04230
We study the equivalence testing problem where the goal is to determine if the given two unknown distributions on $[n]$ are equal or $\epsilon$-far in the total variation distance in the conditional sampling model (CFGM, SICOMP16; CRS, SICOMP15) wher
Externí odkaz:
http://arxiv.org/abs/2308.11558
We study the tolerant testing problem for high-dimensional samplers. Given as input two samplers $\mathcal{P}$ and $\mathcal{Q}$ over the $n$-dimensional space $\{0,1\}^n$, and two parameters $\varepsilon_2 > \varepsilon_1$, the goal of tolerant test
Externí odkaz:
http://arxiv.org/abs/2308.04264
Given a Boolean formula $\phi$ over $n$ variables, the problem of model counting is to compute the number of solutions of $\phi$. Model counting is a fundamental problem in computer science with wide-ranging applications. Owing to the \#P-hardness of
Externí odkaz:
http://arxiv.org/abs/2306.10281
We consider the problem of estimating the support size of a distribution $D$. Our investigations are pursued through the lens of distribution testing and seek to understand the power of conditional sampling (denoted as COND), wherein one is allowed t
Externí odkaz:
http://arxiv.org/abs/2211.11967
Autor:
Thangamuthu, Abishek, Kumar, Gunjan, Bishnoi, Suresh, Bhattoo, Ravinder, Krishnan, N M Anoop, Ranu, Sayan
Recently, graph neural networks have been gaining a lot of attention to simulate dynamical systems due to their inductive nature leading to zero-shot generalizability. Similarly, physics-informed inductive biases in deep-learning frameworks have been
Externí odkaz:
http://arxiv.org/abs/2211.05520
Autor:
Vikram P․R, Hemanth, Kumar, Gunjan, Deka, Rajashree, Hani, Umme, Haider, Nazima, Talath, Sirajunisa, Wali, Adil Farooq, Kandula, Dilipkumar Reddy, Beeraka, Narasimha M., Gopalaiah, Sinchana B, Chiriki, Devi Sri, Bannimath, Namitha, Kumar, Pramod, Gurupadayya, Bannimath
Publikováno v:
In Talanta Open December 2024 10
Autor:
Vikram P.R., Hemanth, Kumar, Gunjan, Deka, Rajashree, Beeraka, Narasimha M., Kandula, Dilipkumar Reddy, Gorti, Santosh Kapil Kumar, Bannimath, Namitha, Kumar, Pramod, Kumar, Tegginamath Pramod, Nikolenko, Vladmir N., Gurupadayya, Bannimath
Publikováno v:
In Microchemical Journal December 2024 207
Consider the problem where $n$ jobs, each with a release time, a deadline and a required processing time are to be feasibly scheduled in a single- or multi-processor setting so as to minimize the total energy consumption of the schedule. A processor
Externí odkaz:
http://arxiv.org/abs/2107.07800
Autor:
Vikram, Hemanth P.R., Kumar, Tegginamath Pramod, Kumar, Gunjan, Beeraka, Narasimha M., Deka, Rajashree, Suhail, Sheik Mohammed, Jat, Sandeep, Bannimath, Namitha, Padmanabhan, Gayatiri, Chandan, Ravandur S., Kumar, Pramod, Gurupadayya, Bannimath
Publikováno v:
In Journal of Pharmaceutical Analysis May 2024 14(5)