Research
Research
Research
Research
137+ open-access research outputs.
This performance presents a duet between two intelligent musical instruments, S\`u (to trace back; to go upstream) and Agentier (playing on agentic clavier), and their human performers, connected thro…
The distance from calibration, introduced by B{\l}asiok, Gopalan, Hu, and Nakkiran (STOC 2023), has recently emerged as a central measure of miscalibration for probabilistic predictors. We study the f…
Motivated by the constructions of pseudorandom sequences over the cyclic elliptic function fields by Hu \textit{et al.} in \text{[IEEE Trans. Inf. Theory, 53(7), 2007]} and the constructions of low-co…
Maximum distance separable (in short, MDS), near MDS (in short, NMDS), and self-orthogonal codes play a pivotal role in algebraic coding theory, particularly in applications such as quantum communicat…
Given an undirected graph $G=(V,E,w)$, a Gomory-Hu tree $T$ (Gomory and Hu, 1961) is a tree on $V$ that preserves all-pairs mincuts of $G$ exactly. We present a simple and efficient randomized reduc…
We present the first non-trivial algorithm for the all-pairs minimum cut problem in the cut-query model. Given cut-query access to an unweighted graph $G=(V,E)$ with $n$ vertices, our randomized algor…
Healthcare professionals have limited time to support patients and their relatives, but their information needs are high. Therefore, the Radboud University together with the Canisius Wilhelmina Hospit…
Steganographic schemes dedicated to generated images modify the seed vector in the latent space to embed a message. Whereas most steganalysis methods attempt to detect the embedding in the image space…
Machine-generated proofs are poised to reach large-scale, human-unreadable artifacts. They foreshadow what we call the Fourth Mathematical Crisis. This crisis crystallizes around three fundamental ten…
Given an undirected graph $G=(V,E,w)$, a Gomory-Hu tree $T$ (Gomory and Hu, 1961) is a tree on $V$ that preserves all-pairs mincuts of $G$ exactly. We present a simple, efficient reduction from Gomo…
In this study, we examine a two-dimensional bin-packing problem in printed circuit board manufacturing. Among other objectives, the number of bins, but also the number of different bin layouts, is to …
This paper presents a two-dimension fuzzy set based approach for matching touch-based gestures using fuzzy cued click point technique. The pro posed approach aims mainly to improve the acceptance of t…
Given an $m$-edge, undirected, weighted graph $G=(V,E,w)$, a Gomory-Hu tree $T$ (Gomory and Hu, 1961) is a tree over the vertex set $V$ such that all-pairs mincuts in $G$ are preserved exactly in $T$.…
Let $f(x)=x^{s(p^m-1)}$ be a power mapping over $\mathbb{F}_{p^n}$, where $n=2m$ and $\gcd(s,p^m+1)=t$. In \cite{kpm-1}, Hu et al. determined the differential spectrum and boomerang spectrum of the po…
We introduce a novel normal form representation of Boolean functions in terms of products of binary matrices, hereafter referred to as the Binary Matrix Product (BMP) representation. BMPs are analogou…
Analyzing the Erasmus mobility network, we illustrate typical problems and approaches in analyzing weighted networks. We propose alternative exploratory views on the network "Erasmus+ learning mobilit…
We study the problem of allocating items to agents with submodular valuations with the goal of maximizing the weighted Nash social welfare (NSW). The best-known results for unweighted and weighted obj…
We provide the first $\widetilde{\mathcal{O}}\left(d\right)$-sample algorithm for sampling from unbounded Gaussian distributions under the constraint of $\left(\varepsilon, \delta\right)$-differential…
We present $k^{O(k^2)} m$ time algorithms for various problems about decomposing a given undirected graph by edge cuts or vertex separators of size $<k$ into parts that are ``well-connected'' with res…
Linear codes with a few weights can be applied to secrete sharing, authentication codes, association schemes and strongly regular graphs. For an odd prime power $q$, we construct a class of three-weig…
Free open-access publishing with Google Scholar indexing.
Submission Guide →