Lithium‐ion batteries (LIBs) remain central to energy storage but suffer from slow ion transport and degradation. Here, we present a binder‐free Ti3C2Tx MXene/GnR hybrid electrode with a porous 3D architecture formed via freeze casting. The structure enhances conductivity, ion transport, and stability, delivering 401 mAh/g, ∼97% efficiency, and 92 ...
Sara Mohseni Taromsari +10 more
wiley +1 more source
FLF-RCNN: A Fine-Tuned Lightweight Faster RCNN for Precise and Efficient Industrial Quality Inspection. [PDF]
An N, Yang Z, Wan L, Li J, Wang Y.
europepmc +1 more source
POLD-YOLO: A Lightweight YOLO11-Based Algorithm for Insulator Defect Detection in UAV Aerial Images. [PDF]
Hu B, Wu F, Zhang P, Cui J, Liu Y.
europepmc +1 more source
A Novel PCB Surface Defect Detection Method Based on the GBE-YOLOv8 Model. [PDF]
Gao C, Zhang X, Bai M, Lian X, Chen S.
europepmc +1 more source
LungNet: Leveraging state-space models with SE-enhanced skip connections for precise CT-based lung lesion segmentation. [PDF]
Mi F, Xu Y, Mi S.
europepmc +1 more source
Computing Rate-Distortion Functions of Continuous Memoryless Sources via Discrete Algorithms: An Integrated Scheme with Convergence Guarantee and Algorithmic Acceleration. [PDF]
Chen L +5 more
europepmc +1 more source
Quantifying transcript complexity via the condition number of gene-specific random matrix. [PDF]
Zhang B, Guo Y, Liu G, Zou M.
europepmc +1 more source
Related searches:
Computational sample complexity
Proceedings of the tenth annual conference on Computational learning theory - COLT '97, 1997Summary: In a variety of PAC learning models, a trade-off between time and information seems to exist: with unlimited time, a small amount of information suffices, but with time restrictions, more information sometimes seems to be required. In addition, it has long been known that there are concept classes that can be learned in the absence of ...
Decatur, Scott E. +2 more
openaire +2 more sources
Computational Complexity and Knowledge Complexity
SIAM Journal on Computing, 1998Summary: We study the computational complexity of languages which have interactive proofs of logarithmic knowledge complexity. We show that all such languages can be recognized in \({\mathcal {BPP}}^{\mathcal {NP}}\). Prior to this work, for languages with greater-than-zero knowledge complexity only trivial computational complexity bounds were known ...
Goldreich, Oded +2 more
openaire +1 more source

