Results 241 to 250 of about 59,031 (278)
Enhancing 3D semantic scene completion with refinement module. [PDF]
Zhang D, Lu J, Yang H, Bao L, Song B.
europepmc +1 more source
MDF2Former: Multi-Scale Dual-Domain Feature Fusion Transformer for Hyperspectral Image Classification of Bacteria in Murine Wounds. [PDF]
Wu D +8 more
europepmc +1 more source
RT-FogNet: real-time ship detection under low-visibility conditions in inland waterways. [PDF]
Yuan P, Xu C, Tan X, Fu S.
europepmc +1 more source
The enhanced EME-YOLOv11 for real-time polarizer defect detection. [PDF]
Liu R, Jing C, Zhang T, Zhang C.
europepmc +1 more source
Free Generalized Gamma Convolutions [PDF]
ما يسمى بيوكسيشن بيركوفيسي باتا يضع مجموعة من القوانين الكلاسيكية القابلة للقسمة بلا حدود لمجموعة من القوانين الحرة القابلة للقسمة بلا حدود. الغرض من هذا العمل هو دراسة القوانين الحرة القابلة للقسمة بلا حدود المقابلة لالتفافات غاما المعممة الكلاسيكية (GGC).
Noriyoshi Sakuma
exaly +4 more sources
ASSOCIATIVE CONVOLUTIONS ARISING FROM CONDITIONALLY FREE CONVOLUTION [PDF]
We define two families of deformations of probability measures depending on the second free cumulants and the corresponding new associative convolutions arising from the conditionally free convolution. These deformations do not commute with dilation of measures, which means that the limit theorems cannot be obtained as a direct application of the ...
Krystek, Anna Dorota +1 more
exaly +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
THE COMBINATORICS OF THE r-FREE CONVOLUTION
Infinite Dimensional Analysis, Quantum Probability and Related Topics, 2003In this paper we shall give combinatorial remarks on the r-free convolution. In particular, we shall introduce the set partition statistic on non-crossing partitions, which gives the r-free deformed moment-cumulant formula. We shall also give the probability measure of the r-free Poisson law and its moments, exactly.
Krystek, Anna, Yoshida, Hiroaki
openaire +2 more sources
On the free distance of LDPC convolutional codes
International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings., 2004A lower bound on the free distance of LDPC convolutional codes defined by syndrome former matrices comprised of MtimesM permutation matrices is derived. We show that asymptotically, i.e., as Mrarrinfin, for almost all codes in the ensemble the free distance grows linearly with constraint ...
Arvind Sridharan +4 more
openaire +1 more source

