2,646+ open-access research outputs.
Retrieval-augmented generation (RAG) systems are frequently evaluated via fact-based metrics, yet standard implementations retrieve passages or static propositions. This unit mismatch between evaluatiโฆ
Differential-difference matrix Lax representations (Lax pairs), gauge transformations, and discrete Miura-type transformations (MTs) belong to the main tools in the theory of (nonlinear) integrable diโฆ
In decentralized non-custodial micropayments, the central challenge is not whether payments can be executed directly, but under what conditions such systems can offer credit limits without requiring fโฆ
We present Marco-MoE, a suite of fully open multilingual sparse Mixture-of-Experts (MoE) models. Marco-MoE features a highly sparse design in which only around 5\% of the total parameters are activateโฆ
This study examines the global impacts of a localized disruption in Qatar's gas sector using a multi-regional input-output framework and scenario-based analysis. While the direct impacts of this disruโฆ
Rasterization based methods have recently enabled high-quality novel view synthesis at real-time rates, but their underlying volumetric primitives do not expose a direct, globally consistent surface rโฆ
Generative retrieval (GR) ranks documents by autoregressively generating document identifiers. Because many GR methods rely on trie-constrained beam search, they are vulnerable to early pruning of relโฆ
Generative information retrieval (GenIR) consolidates retrieval into a single neural model that decodes document identifiers (docids) directly from queries. While this model-as-index paradigm offers aโฆ
Unlike traditional fact-based retrieval, rationale-based retrieval typically necessitates cross-encoding of query-document pairs using large language models, incurring substantial computational costs.โฆ
Recently, Arag\~{a}o, Marciano, and Mendon\c{c}a [\emph{European J. Combin.}, 2025] conjectured that for any graph $G$ on $n$ vertices satisfying $(r-1)(t-1)k < n \le (r-1)(t-1)(k+1)$, the minimum degโฆ
Recent advances in semantic correspondence rely on dual-encoder architectures, combining DINOv2 with diffusion backbones. While accurate, these billion-parameter models generalize poorly beyond trainiโฆ
Simulating group-level user behavior enables scalable counterfactual evaluation of merchant strategies without costly online experiments. However, building a trustworthy simulator faces two structuralโฆ
As reinforcement learning for humanoid robots evolves from single-task to multi-skill paradigms, efficiently expanding new skills while avoiding catastrophic forgetting has become a key challenge in eโฆ
Neural operators have been increasingly used as data-driven surrogates for time-marching predictions of turbulent flows. However, long-horizon autoregressive prediction is sensitive to error accumulatโฆ
Surface wave tomography is essential for investigating the shear-wave velocity structure of the crust and upper mantle. The direct surface wave tomography method, DSurfTomo, has become one of the mostโฆ
Reproducibility must validate architectural robustness, not just numerical accuracy. We evaluate ColBERT-v2 and ConstBERT across five dimensions, finding that while ConstBERT reproduces within 0.05% Mโฆ
Our goal in this paper is twofold. First, we characterize the class of pairwise interactions for which the Seidl conjecture on the structure of optimal plans for the symmetric multimarginal optimal trโฆ
Geometric high-fidelity mesh reconstruction from LiDAR-inertial scans remains challenging in large, complex indoor environments -- such as cultural buildings -- where point cloud sparsity, geometric dโฆ
Finding parking consumes a disproportionate share of food delivery time, yet no system addresses precise parking-spot selection relative to merchant entrances. We propose ParkSense, a framework that rโฆ
Online marketplaces increasingly do more than simply match buyers and sellers: they route orders across competing sellers and, in many categories, offer ancillary fulfillment services that make sellerโฆ
Free open-access publishing with Google Scholar indexing.
Submission Guide โ