Zobrazeno 1 - 10
of 25 806
pro vyhledávání: '"Ramkumar, A."'
Autor:
Ramkumar, Kushal, Cai, Wanling, McCarthy, John, Doherty, Gavin, Nuseibeh, Bashar, Pasquale, Liliana
Security attacks are rising, as evidenced by the number of reported vulnerabilities. Among them, unknown attacks, including new variants of existing attacks, technical blind spots or previously undiscovered attacks, challenge enduring security. This
Externí odkaz:
http://arxiv.org/abs/2412.10738
Autor:
Ramkumar, Akshar, Soleimanifar, Mehdi
Providing evidence that quantum computers can efficiently prepare low-energy or thermal states of physically relevant interacting quantum systems is a major challenge in quantum information science. A newly developed quantum Gibbs sampling algorithm
Externí odkaz:
http://arxiv.org/abs/2411.04454
Locally recoverable codes (LRCs) with locality parameter $r$ can recover any erased code symbol by accessing $r$ other code symbols. This local recovery property is of great interest in large-scale distributed classical data storage systems as it lea
Externí odkaz:
http://arxiv.org/abs/2411.01504
We use phase space distributions specifically, the Wigner distribution (WD) and Husimi distribution (HD) to investigate certain information-theoretic measures as descriptors for a given system. We extensively investigate and analyze Shannon, Wehrl an
Externí odkaz:
http://arxiv.org/abs/2410.16338
Autor:
Ramkumar, Ritvik, Sammartano, Alessio
Let S be the Cox ring of a product of r projective spaces. In this paper, we study the Cartwright-Sturmfels Hilbert schemes of S, which are multigraded Hilbert schemes that only parametrize radical ideals. Our main result shows that these Hilbert sch
Externí odkaz:
http://arxiv.org/abs/2410.10478
We resolve an open problem posed by Alexeev-Knutson on the projectivity of the moduli of branchvarieties in the equidimensional case. As an application, we construct projective moduli spaces of reduced equidimensional varieties equipped with ample li
Externí odkaz:
http://arxiv.org/abs/2410.10753
Graphs of Convex Sets (GCS) is a recent method for synthesizing smooth trajectories by decomposing the planning space into convex sets, forming a graph to encode the adjacency relationships within the decomposition, and then simultaneously searching
Externí odkaz:
http://arxiv.org/abs/2410.08909
We investigate the Hilbert scheme of points on a smooth threefold. We introduce a notion of broken Gorenstein structure for finite schemes, and show that its existence guarantees smoothness on the Hilbert scheme. Moreover, we conjecture that it is ex
Externí odkaz:
http://arxiv.org/abs/2409.17009
Autor:
Passigan, Pascal, Ramkumar, Vayd
The integration of Artificial Intelligence (AI) in medical diagnostics is often hindered by model opacity, where high-accuracy systems function as "black boxes" without transparent reasoning. This limitation is critical in clinical settings, where tr
Externí odkaz:
http://arxiv.org/abs/2409.13589
Minimum storage regenerating (MSR) codes are a class of maximum distance separable (MDS) array codes capable of repairing any single failed node by downloading the minimum amount of information from each of the helper nodes. However, MSR codes requir
Externí odkaz:
http://arxiv.org/abs/2408.16584