A Gaussian mean width bound in weighted geometry yields a single-letter strong converse for the classical identification capacity of quantum channels, improving known results for depolarizing, Pauli, erasure, and amplitude damping channels.
hub
1970.tb01770.x
16 Pith papers cite this work. Polarity classification is still indexing.
16
Pith papers citing it
hub tools
citation-role summary
background 3
citation-polarity summary
roles
background 3polarities
background 3representative citing papers
Enumerative realization of RLIM codes achieves exponential-to-polynomial storage reduction while maintaining code properties and enabling better bit-error-rate performance in larger dimensions for molecular communication.
The Deng-Hani molecule reduction algorithm constructs a Kruskal spanning tree of the input molecule.
Unified LOLA framework combining runtime verification and model-based diagnosis for simultaneous online fault detection and localization, supporting time-invariant, transient, and nondeterministic cases.
An algorithm computes the bandwidth of normal timed automata by reducing the problem to finding the maximum reward-to-cost ratio in a weighted finite graph built from the automaton.
Information defined as maximum-caliber deviation derives IIT 3.0 cause-effect repertoires from constrained entropy maximization and equates to prediction error under CLT and LDT.
ReBaHFC refines PaToH outputs with the new HyperFlowCutter flow algorithm to deliver hypergraph bipartition quality close to KaHyPar and hMETIS while running an order of magnitude faster.
MDE computes three entropy features from flow stats to match conventional ML performance (F1 0.708-0.989) on four IDS benchmarks while exposing aggregate-metric failures and providing stable SHAP attributions.
Semi-automatic method corrects topological artifacts in 3D tubular skeletons using component-wise MST and filtered Delaunay triangulation from minimal user input.
Mixup applied only to the student during KD induces independent linearity acquisition that reduces overconfidence by an order of magnitude while improving accuracy, with calibration transferring separately from accuracy.
LDGM codes enable syndrome measurement for QLDPC codes with controlled constant-weight stabilizers, yielding lower logical error rates than repeated extraction on a distance-5 surface code.
Analysis of Shannon capacity statistics at handover, proximity, and interference epochs in a dynamical Poisson-Voronoi network with an analogy to seasonal fluctuations in signal quality.
SemML 2.0 outperforms prior LTL synthesis tools on SYNTCOMP by solving more instances faster with comparable solution quality.
DACL reports up to 2.77% Dice improvement and 14.69 mm HD95 reduction in fetal US segmentation under 5% labeled data via dual-agreement consistency between CNN and Transformer networks.
A semi-supervised teacher-student framework enables neural networks to proxy CVaR portfolio optimization using synthetic data augmentation for scarce labels and regime shifts.
citing papers explorer
-
Gaussian mean width strong converse bound on the classical identification capacity of quantum channels
A Gaussian mean width bound in weighted geometry yields a single-letter strong converse for the classical identification capacity of quantum channels, improving known results for depolarizing, Pauli, erasure, and amplitude damping channels.
-
Low-Complexity Run-Length-Limited ISI-Mitigation (RLIM) Codes for Molecular Communication
Enumerative realization of RLIM codes achieves exponential-to-polynomial storage reduction while maintaining code properties and enabling better bit-error-rate performance in larger dimensions for molecular communication.
-
Kruskal-style algorithm for cubic Schr\"odinger equation molecule reduction
The Deng-Hani molecule reduction algorithm constructs a Kruskal spanning tree of the input molecule.
-
A Unified Framework for Runtime Verification and Model-Based Diagnosis in LOLA
Unified LOLA framework combining runtime verification and model-based diagnosis for simultaneous online fault detection and localization, supporting time-invariant, transient, and nondeterministic cases.
-
Weighing Timed Regular Languages: The Final Step (long version)
An algorithm computes the bandwidth of normal timed automata by reducing the problem to finding the maximum reward-to-cost ratio in a weighted finite graph built from the automaton.
-
Information as Maximum-Caliber Deviation: A bridge between Integrated Information Theory and the Free Energy Principle
Information defined as maximum-caliber deviation derives IIT 3.0 cause-effect repertoires from constrained entropy maximization and equates to prediction error under CLT and LDT.
-
Multi-Level Distributional Entropy for Explainable Network Intrusion Detection
MDE computes three entropy features from flow stats to match conventional ML performance (F1 0.708-0.989) on four IDS benchmarks while exposing aggregate-metric failures and providing stable SHAP attributions.
-
Semi-Automatic Correction of 3D Tubular Structure Skeletons via Component-Wise MST and Filtered Delaunay Triangulation
Semi-automatic method corrects topological artifacts in 3D tubular skeletons using component-wise MST and filtered Delaunay triangulation from minimal user input.
-
Beyond Dark Knowledge: Mixup-Based Distillation for Reliable Predictions
Mixup applied only to the student during KD induces independent linearity acquisition that reduces overconfidence by an order of magnitude while improving accuracy, with calibration transferring separately from accuracy.
-
Fault-Tolerant QLDPC Syndrome Measurement via LDGM Encoding
LDGM codes enable syndrome measurement for QLDPC codes with controlled constant-weight stabilizers, yielding lower logical error rates than repeated extraction on a distance-5 surface code.
-
Seasonal Statistics of Shannon Capacity in a Dynamical Poisson-Voronoi Cellular Network
Analysis of Shannon capacity statistics at handover, proximity, and interference epochs in a dynamical Poisson-Voronoi network with an analogy to seasonal fluctuations in signal quality.
-
SemML 2.0: Synthesizing Controllers for LTL
SemML 2.0 outperforms prior LTL synthesis tools on SYNTCOMP by solving more instances faster with comparable solution quality.
-
Dual Agreement Consistency Learning for Semi-Supervised Fetal Ultrasound Segmentation
DACL reports up to 2.77% Dice improvement and 14.69 mm HD95 reduction in fetal US segmentation under 5% labeled data via dual-agreement consistency between CNN and Transformer networks.
-
Portfolio Optimization Proxies under Label Scarcity and Regime Shifts via Bayesian and Deterministic Students under Semi-Supervised Sandwich Training
A semi-supervised teacher-student framework enables neural networks to proxy CVaR portfolio optimization using synthetic data augmentation for scarce labels and regime shifts.
- Emergence of Complex Web Structures