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.
1970.tb01770.x
8 Pith papers cite this work. Polarity classification is still indexing.
8
Pith papers citing it
citation-role summary
background 3
citation-polarity summary
roles
background 3polarities
background 3representative citing papers
The Deng-Hani molecule reduction algorithm constructs a Kruskal spanning tree of the input molecule.
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.
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.
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
-
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.
-
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.
-
Evaluation of a Flow-Based Hypergraph Bipartitioning Algorithm
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.
-
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.
-
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