Zobrazeno 1 - 10
of 10 112
pro vyhledávání: '"P. Shashank"'
Autor:
Alochukwu, Alex S. A., Dossou-Olory, Audace A. V., Osaye, Fadekemi J., Rakotonarivo, Valisoa R. M., Ravichandran, Shashank, Selkirk, Sarah J., Wang, Hua, Whitlatch, Hays
The rank (also known as protection number or leaf-height) of a vertex in a rooted tree is the minimum distance between the vertex and any of its leaf descendants. We consider the sum of ranks over all vertices (known as the security) in binary trees,
Externí odkaz:
http://arxiv.org/abs/2411.19188
Autor:
Ozden, Tarik Can, Kara, Ozgur, Akcin, Oguzhan, Zaman, Kerem, Srivastava, Shashank, Chinchali, Sandeep P., Rehg, James M.
Current image immunization defense techniques against diffusion-based editing embed imperceptible noise in target images to disrupt editing models. However, these methods face scalability challenges, as they require time-consuming re-optimization for
Externí odkaz:
http://arxiv.org/abs/2411.17957
Device-independent quantum key distribution (DI-QKD) leverages nonlocal correlations to securely establish cryptographic keys between two honest parties while making minimal assumptions about the underlying systems. The security of DI-QKD relies on t
Externí odkaz:
http://arxiv.org/abs/2411.16822
The palindromic automorphism group is a subgroup of the automorphism group $Aut(F_3).$ We establish a necessary and sufficient condition for a matrix in $GL_n(\mathbb{Z})$ representing a palindromic automorphism of $F_n.$ We prove that the number of
Externí odkaz:
http://arxiv.org/abs/2411.15547
According to the celebrated singularity theorems, space-time singularities in general relativity are inevitable. However, it is generally believed that singularities do not exist in nature, and their existence suggests the necessity of a new theory o
Externí odkaz:
http://arxiv.org/abs/2411.13897
Autor:
Ravichandir, Shashank, Valecha, Bhavesh, Muzzeddu, Pietro Luigi, Sommer, Jens-Uwe, Sharma, Abhinav
The transport of molecules for chemical reactions is critically important in various cellular biological processes. Despite thermal diffusion being prevalent in many biochemical processes, it is unreliable for any sort of directed transport or prefer
Externí odkaz:
http://arxiv.org/abs/2411.12325
Sleep staging is a challenging task, typically manually performed by sleep technologists based on electroencephalogram and other biosignals of patients taken during overnight sleep studies. Recent work aims to leverage automated algorithms to perform
Externí odkaz:
http://arxiv.org/abs/2411.07964
Autor:
Bergamaschi, Thiago, Jeronimo, Fernando Granha, Mittal, Tushant, Srivastava, Shashank, Tulsiani, Madhur
We give a construction of Quantum Low-Density Parity Check (QLDPC) codes with near-optimal rate-distance tradeoff and efficient list decoding up to the Johnson bound in polynomial time. Previous constructions of list decodable good distance quantum c
Externí odkaz:
http://arxiv.org/abs/2411.04306
Autor:
Nag, Shashank, Bacellar, Alan T. L., Susskind, Zachary, Jha, Anshul, Liberty, Logan, Sivakumar, Aishwarya, John, Eugene B., Kailas, Krishnan, Lima, Priscila M. V., Yadwadkar, Neeraja J., Franca, Felipe M. G., John, Lizy K.
Transformers are set to become ubiquitous with applications ranging from chatbots and educational assistants to visual recognition and remote sensing. However, their increasing computational and memory demands is resulting in growing energy consumpti
Externí odkaz:
http://arxiv.org/abs/2411.01818
In 1994, Erd\H{o}s and Gy\'arf\'as conjectured that every graph with minimum degree at least 3 has a cycle of length a power of 2. In 2022, Gao and Shan (Graphs and Combinatorics) proved that the conjecture is true for $P_8$-free graphs, i.e., graphs
Externí odkaz:
http://arxiv.org/abs/2410.22842