6,730+ open-access research outputs.
The toughness of a graph $G$, denoted by $\tau(G)$, is defined by $\tau(G)=$min $\{\frac{|S|}{c(G-S)}:S\subseteq V(G)$ and $c(G-S)\geq2\}$. A graph $G$ is said to be $\tau$-tough if $\tau(G)\geq \tau$…
Let $ n \in \mathbb{N} $ with $ n \geq 3 $, and let $\mathcal{G} = \{G_i:i\in [n]\} $ be a family of $ n $-vertex graphs on a common vertex set $V$, where the graphs in the family do not need to be di…
Imaginary-time evolution is a standard primitive for ground-state preparation but is nonunitary, precluding direct quantum implementation. We develop Finite Imaginary-Time Evolution (FinITE), a finite…
Long-context LLM serving is bottlenecked by the cost of attending over ever-growing KV caches. Dynamic sparse attention promises relief by accessing only a small, query-dependent subset of the KV stat…
Finite local Hilbert-space truncations arise naturally in quantum simulations of lattice field theories and motivate qudit encodings, but their fault-tolerant advantage over qubit encodings remains un…
We prove that any continuous function f from [0,1]^n to R representable by a finite computation tree with N internal nodes and compositional sparsity s = O(1) admits a deep Kolmogorov-Arnold Network (…
Solving large, sparse linear systems is a fundamental workload in scientific computing and engineering simulations, often dominating runtime and energy consumption in high-performance computing (HPC) …
Several Lyman-alpha (Ly$\alpha$) emitters deep into the reionization era exhibit double-peaked Ly$\alpha$ emission profiles, raising the question of how the intergalactic medium can transmit photons b…
Motivated by the elastic-viscous-plastic (EVP) sea-ice model [E. C. Hunke and J. K. Dukowicz, J. Phys. Oceanogr., 27, 9 (1997), 1849--1867], which is used in large-scale numerical climate simulations,…
All current LLM serving systems place the GPU at the center, from production-level attention-FFN disaggregation to NVIDIA's Rubin GPU-LPU heterogeneous platform. Even academic PIM/PNM proposals still …
Lattice Boltzmann (LB) on quantum devices must reconcile unitary gate evolution with the dissipative \emph{collision} step. In the multiple-relaxation-time (MRT) class, we work in the common setting o…
We present a comprehensive analysis of circumgalactic Lya nebulae around 59 unobscured and 26 obscured quasars at z=2-3, observed with the Keck Cosmic Web Imager (KCWI), to constrain the nature of act…
Rapid advances in Large Language Models (LLMs) create new opportunities by enabling efficient exploration of broad, complex design spaces. This is particularly valuable in computer architecture, where…
In this article, we develop an efficient algorithm based on three special variants of the nonlinear conjugate gradient method, namely, the Polak--Ribiere--Polyak, Hestenes--Stiefel, and Liu--Story sch…
Topology reasoning is crucial for autonomous driving. Current methods primarily focus on instance-level learning for centerline detection, followed by a sequential module for topology reasoning that r…
A classical result of Cioab\u{a} states that if $G$ is a connected graph with the unit Perron vector $\mathbf{x}$, then any independent set $S$ of $G$ satisfies $\sum_{v\in S} x_v^2 \le \frac{1}{2}$, …
We analyze the universal approximation property of Kolmogorov-Arnold Networks (KANs) in terms of their edge functions. If these functions are all affine, then universality clearly fails. How many non-…
In 1965 Kraichnan pointed out that a sufficiently strong background magnetic field, i.e. the case of small Alfv\'en number, will reduce the nonlinear interaction and inhibit the formation of strong gr…
Machine learning methods that predict initial guesses from molecular geometry can reduce this cost, but matrix-prediction models fail when extrapolating to larger molecules, degrading rather than acce…
This paper considers constrained stochastic nonsmooth minimax optimization problem of the form $\min_{\mathbf{x}\in\mathcal{X}}\max_{\mathbf{y}\in\mathcal{Y}}f\left(\mathbf{x},\mathbf{y}\right)=\mathb…
Free open-access publishing with Google Scholar indexing.
Submission Guide →