Zobrazeno 1 - 10
of 9 175
pro vyhledávání: '"Satyam, A."'
Autor:
Goswami, Ashish, Modi, Satyam Kumar, Deshineni, Santhosh Rishi, Singh, Harman, P, Prathosh A., Singla, Parag
Text-to-image (T2I) generation has seen significant progress with diffusion models, enabling generation of photo-realistic images from text prompts. Despite this progress, existing methods still face challenges in following complex text prompts, espe
Externí odkaz:
http://arxiv.org/abs/2412.06089
Autor:
Naskar, Joydeep, Samal, Sai Satyam
Topological entanglement entropy (TEE) is an efficient way to detect topological order in the ground state of gapped Hamiltonians. The seminal work of Kitaev and Preskill~\cite{preskill-kitaev-tee} and simultaneously by Levin and Wen~\cite{levin-wen-
Externí odkaz:
http://arxiv.org/abs/2412.05484
We present algorithms for the online minimum hitting set problem: Given a set $P$ of $n$ points in the plane and a sequence of geometric objects that arrive one-by-one, we need to maintain a hitting set at all times. For disks of radii in the interva
Externí odkaz:
http://arxiv.org/abs/2412.04646
The paper focuses on studying strong geodetic sets and numbers in the context of corona-type products of graphs. Our primary focus is on three variations of the corona products: the generalized corona, generalized edge corona, and generalized neighbo
Externí odkaz:
http://arxiv.org/abs/2411.13139
Autor:
Prakash, Satyam, Vudayagiri, Ashok S
When ultracold plasma is generated using photonization of laser cooled atoms, some atoms reach only upto Rydberg states. These in turn interact with the free electrons of the plasma and get ionized further. We study the interaction of electron-Rydber
Externí odkaz:
http://arxiv.org/abs/2410.09387
VC-dimension and $\varepsilon$-nets are key concepts in Statistical Learning Theory. Intuitively, VC-dimension is a measure of the size of a class of sets. The famous $\varepsilon$-net theorem, a fundamental result in Discrete Geometry, asserts that
Externí odkaz:
http://arxiv.org/abs/2410.07059
The hitting set problem is one of the fundamental problems in combinatorial optimization and is well-studied in offline setup. We consider the online hitting set problem, where only the set of points is known in advance, and objects are introduced on
Externí odkaz:
http://arxiv.org/abs/2409.11166
The cellular wireless networks are evolving towards acquiring newer capabilities, such as sensing, which will support novel use cases and applications. Many of these require indoor sensing capabilities, which can be realized by exploiting the perturb
Externí odkaz:
http://arxiv.org/abs/2409.00634
The recent detection of CN-functionalized aromatics partly addresses the long-standing mystery of the apparent absence of five- and six-membered rings in interstellar environments. N-heterocycles, which are crucial as the fundamental structures of nu
Externí odkaz:
http://arxiv.org/abs/2408.16253
Autor:
Guragain, Satyam, Srivastava, Ravi
A graph $G$ is $k$-edge geodetic graph if every edge of $G$ lies in at least one geodesic of length $k$. We studied some basic properties of $k$-edge geodetic graphs. We investigated the $k$ edge-geodeticity of complete bipartite graph $K_{m,n}$ and
Externí odkaz:
http://arxiv.org/abs/2408.05519