O(2^|C|
No mentions found
This entity hasn't been tracked yet, or Iris is still building its knowledge base.
Related Articles from SNS
High-Purity Diamond Integration on $\beta$-Ga$_2$O$_3$ via Microwave Plasma CVD for Enhanced Thermal Management
arXiv:2511.08758v2 Announce Type: replace Abstract: The integration of diamond with $\beta$-Ga$_2$O$_3$ presents a promising pathway to enhance thermal management in high-power electronic devices, where the inherently low thermal conductivity of $\beta$-Ga$_2$O$_3$ can lead to localized self-heating and elevated junction temperatures. In this work, we demonstrate a scalable, low-damage approach for integrating polycrystalline diamond films on (010) $\beta$-Ga$_2$O$_3$ substrates via...
Fast-Neutron Irradiation Effect in Heteroepitaxial $\beta$-Ga$_2$O$_3$ Schottky Diodes Fabricated on Low-Cost Sapphire Substrates
Announce Type: new Abstract: In this work, we investigate the response of Ni/$\beta$-Ga$_2$O$_3$ Schottky barrier diodes fabricated on c-plane sapphire to fast-neutron irradiation up to a fluence of $1\times10^{15}$ n$\cdot$cm$^{-2}$. The LPCVD-grown heteroepitaxial structure consists of an unintentionally doped buffer, an n$^{+}$ contact layer, and an n-type drift layer, with mesa isolation realized by plasma-free Ga-assisted LPCVD etching. Prior to irradiation, the devices exhibit a...
Statistically Reliable LLM-Based Ranking Evaluation via Prediction-Powered Inference
arXiv:2606.05308v1 Announce Type: new Abstract: With PRECISE, we extended Prediction-Powered Inference to produce bias-corrected estimates of ranking evaluation metrics by combining a small human-labeled set with a large LLM-judged set. PPI is provably unbiased regardless of the LLM judge's error profile. We make it applicable to hierarchical metrics like Precision@K, where annotations are per-document but the metric is per-query, by reducing the output-space computation from O(2^|C|) to O(2^K).
Bounds for Single-Error-Correcting Analog Codes
arXiv:2606.03011v1 Announce Type: new Abstract: We study single-error correction for analog codes over $\mathbb{R}$. A key performance measure is the parameter $\Gamma_2(\mathcal{C})$, which quantifies the minimum separation required between large outlying errors that need to be located/corrected and bounded tolerable perturbations. We prove that every real linear $[n,n-2]$ code $\mathcal{C}$ satisfies \[ \Gamma_2(\mathcal{C})\ge \frac{1}{\sin^2(\pi/2n)}. This resolves Roth's open problem on...
Ultrafast machine learning on FPGAs via Kolmogorov-Arnold Networks
Ultrafast machine learning on FPGAs via Kolmogorov-Arnold Networks This post is a high-level explainer for my Master’s thesis, which involves designing hardware architectures for ultrafast inference and online learning using the Kolmogorov-Arnold Network (KAN) architecture. I’ll assume familiarity with standard machine learning concepts, as well as some understanding of hardware and digital circuits; read my previous post here for the latter. Please read the two papers below for more...
PRECISE: Reducing the Bias of LLM Evaluations Using Prediction-Powered Ranking Estimation
Announce Type: cross Abstract: Evaluating the quality of search, ranking and RAG systems traditionally requires a significant number of human relevance annotations. In recent times, several deployed systems have explored the usage of Large Language Models (LLMs) as automated judges for this task while their inherent biases prevent direct use for metric estimation. We present a statistical framework extending Prediction-Powered Inference (PPI) that combines minimal human annotations with LLM...
Almost balanced ordered biclique covering of graphs
arXiv:2606.08506v1 Announce Type: cross Abstract: Let $f(n,k)$ be the minimum size of a collection of bicliques such that (i) every edge of the complete graph $K_n$ is covered by at least one and at most $k$ bicliques in the collection, and (ii) for each edge $\{u,v\}$, the number of bicliques in which $u$ appears in the first class and $v$ in the second class differs by at most one from the number of bicliques in which $u$ appears in the second class and $v$ in the first class. For $k=1$,...
Erd\H{o}s Rado Sunflower Theorem for Shifted Families
Combinatorics [Submitted on 1 Jun 2026 (v1), last revised 8 Jun 2026 (this version, v2)] Title:Erdős Rado Sunflower Theorem for Shifted Families View PDF HTML (experimental)Abstract:Let $f(k,s)$ denote the minimum integer $m$ such that any family $\mathcal{F}$ consisting of $k$-sized sets of cardinality at least $m$ always contain a sunflower of size $s$. The Erdős-Rado Sunflower Conjecture states that for every $s >2$, there is an constant $C=C(s)$ such that $f(k,s) \leq C^k$.
Listing Even Cycles Faster than the Submodular-Width Barrier
arXiv:2605.30564v1 Announce Type: new Abstract: A classic result of Alon, Yuster, and Zwick (AYZ, Algorithmica 1997) shows that all $2k$-cycles in an $m$-edge graph can be listed in $\tilde O(m^{2-1/k}+t)$ time, where $t$ is the output size. This bound underlies the {\em submodular width} of Marx (JACM 2013) and the PANDA framework of Abo Khamis, Ngo, and Suciu (PODS 2017), which extend AYZ to arbitrary conjunctive queries with degree constraints. A central open question is whether...
Tree Containment Parameterized by Scanwidth
Announce Type: new Abstract: TREE CONTAINMENT is a central decision problem in mathematical phylogenetics, asking whether a given rooted phylogenetic tree is embeddable in ("displayed by") a given rooted phylogenetic network. While the problem is NP-complete for general networks, many algorithmic advances have relied on structural parameters that capture how "tree-like" a network is. In this paper we investigate TREE CONTAINMENT under the structural parameter scanwidth, a directed width...