78+ open-access research outputs.
Large language models perform well on many reasoning tasks, yet they often lack awareness of whether their current knowledge or reasoning state is complete. In non-interactive puzzle settings, the narโฆ
We study the minimum degree threshold $\delta_{r,q}$ guaranteeing the existence of $K_r$-tilings of high discrepancy in any $q$-edge-coloring. Balogh, Csaba, Pluh\'ar and Treglown handled the 2-color โฆ
Assumption-based Argumentation (ABA) is a well-established form of structured argumentation. ABA frameworks with an underlying atomic language are widely studied, but their applicability is limited byโฆ
The escalating sophistication of phishing emails necessitates a shift beyond traditional rule-based and conventional machine-learning-based detectors. Although large language models (LLMs) offer stronโฆ
This paper addresses the problem of detecting and estimating the anisotropy of a stationary real-valued random field from a single realization of one of its excursion sets. This setting is challengingโฆ
I introduce Virtual Parameter Sharpening (VPS), an inference-time technique that augments frozen transformer linear layers with dynamic, activation-conditioned low-rank perturbations. Unlike parameterโฆ
Multi-robot systems have emerged as a key technology for addressing the efficiency and cost challenges in labor-intensive industries. In the representative scenario of smart farming, planning efficienโฆ
The extent to which large language models (LLMs) can perform culturally grounded reasoning across non-English languages remains underexplored. This paper examines the reasoning and self-assessment abiโฆ
Due to its powerful capability of self-supervised representation learning and clustering, contrastive attributed graph clustering (CAGC) has achieved great success, which mainly depends on effective dโฆ
A classical result of Dirac says that every $n$-vertex graph with minimum degree at least $\frac{n}{2}$ contains a Hamilton cycle. A `discrepancy' version of Dirac's theorem was shown by Balogh--Csabaโฆ
Despite advances in natural language generation and understanding, LM still struggle with fine grained linguistic phenomena such as tense, negation, voice, and modality which are the elements central โฆ
Dirac's classical theorem asserts that, for $n \ge 3$, any $n$-vertex graph with minimum degree at least $n/2$ is Hamiltonian. Furthermore, if we additionally assume that such graphs are regular, thenโฆ
We investigate Hamilton cycles in edge-colored graphs with \( r \) colors, focusing on the notion of color-bias (discrepancy), the maximum deviation from uniform color frequencies along a cycle. Foundโฆ
User journeys in e-commerce routinely violate the one-to-one assumption that a clicked item on an advertising platform is the same item later purchased on the merchant's website/app. For a significantโฆ
Given a graph $G$ and an $r$-edge-colouring $\chi$ on $E(G)$, a Hamilton cycle $H\subset G$ is said to have $t$ colour-bias if $H$ contains $n/r+t$ edges of the same colour in $\chi$. Freschi, Hyde, Lโฆ
We study the problem of Gaussian bandits with general side information, as first introduced by Wu, Szepesvari, and Gyorgy. In this setting, the play of an arm reveals information about other arms, accโฆ
We demonstrate that large language models' (LLMs) mathematical reasoning is culturally sensitive: testing 14 models from Anthropic, OpenAI, Google, Meta, DeepSeek, Mistral, and Microsoft across six cuโฆ
Traditional base station siting (BSS) methods rely heavily on drive testing and user feedback, which are laborious and require extensive expertise in communication, networking, and optimization. As laโฆ
A separating system of a graph $G$ is a family $\mathcal{S}$ of subgraphs of $G$ for which the following holds: for all distinct edges $e$ and $f$ of $G$, there exists an element in $\mathcal{S}$ thatโฆ
This paper explores the segmentation of very small medical objects with significant clinical value. While Convolutional Neural Networks (CNNs), particularly UNet-like models, and recent Transformers hโฆ
Free open-access publishing with Google Scholar indexing.
Submission Guide โ