32,275+ open-access research outputs.
This paper studies a key research question: how to achieve perfect privacy in over-the-air computation (AirComp)? The problem is particularly intriguing due to a dilemma. Real-field operations can ens…
Large Language Models (LLMs) have advanced Table Question Answering, where most queries can be answered by extracting information or simple aggregation. However, a common class of real-world queries i…
Recent research has shown that filtering massive English web corpora into high-quality subsets significantly improves training efficiency. However, for high-resource non-English languages like German,…
The integration of artificial intelligence (AI) into healthcare has advanced significantly, yet affect recognition remains a major challenge, particularly in AI-assisted interventions such as Computer…
Task-based dialogue systems assist users in achieving specific goals, such as executing actions or retrieving information, through natural language interactions. Accurate coreference resolution is ess…
This paper proposes a bitwise over-parameterized neural network (ONN) decoder for polar-coded transmission and develops a tractable theoretical performance analysis framework. By modeling each synthes…
Future uncrewed aerial vehicle (UAV) systems increasingly combine heterogeneous communication technologies, such as low-latency aerial mesh, terrestrial cellular, and satellite links, to improve robus…
Vision-and-Language Navigation (VLN) aims to enable an embodied agent to follow natural-language instructions and navigate to a target location in unseen 3D environments. We argue that adapting VLMs t…
A self-contained introduction to infinite dimensional representations over a tame hereditary algebra is provided, assuming a basic knowledge of the category of finite dimensional representations. This…
We prove that the Lorentz--FitzGerald contraction is the unique deformation of a resonant cavity moving through a mechanical wave medium that preserves spherical-harmonic phase closure. For a cavity m…
In this paper, we utilize our previous results on mod p monodromy of cyclic coverings of the projective line to realize a large series of groups of the form PSL(n, q) and PSU(n, q) as Galois groups ov…
We study the set of solutions to a parameterized, strongly convex optimization problem whose cost depends on uncertain, bounded parameters. We compute a certified outer approximation of the correspond…
The generalized composition graph is used by Cardoso and some researchers for factorization of the adjacency spectrum and Laplacian of a simple graph. Because the generalized composition graph is an e…
The Alternating Direction Method of Multipliers (ADMM) is a widely used method for structured convex optimization, and its practical performance depends strongly on the choice of penalty and relaxatio…
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…
Long-range quantum entanglement is essential for building large-scale quantum networks and unconditionally secure cryptographic systems based on quantum key distribution (QKD). While photonic integrat…
In this work, we study the codes over the integers with locality constraints. We introduce a weighted notion of locality over $\mathbb{Z}/q_1\mathbb{Z} \times \cdots \times \mathbb{Z}/q_n\mathbb{Z}$ a…
The purpose of this article is to study certain binary relations of endomorphisms over infinite dimensional vector spaces defined by GD1 and 1GD generalized inverses. In order to do so, these generali…
The average symbol error probability (SEP) of a phase-quantized single-input multiple-output system with M-ary phase-shift keying modulation and maximum ratio combining (MRC) is analyzed under correla…
This article presents a brief account of Amir O. Caldeira's contributions to the theory of quantum Brownian motion. Motivated by its importance, we outline the description of Brownian motion in the qu…
Free open-access publishing with Google Scholar indexing.
Submission Guide →