بدائل البحث:
designed optimization » design optimization (توسيع البحث), based optimization (توسيع البحث), guided optimization (توسيع البحث)
joint optimization » policy optimization (توسيع البحث), wolf optimization (توسيع البحث), codon optimization (توسيع البحث)
images designed » scales designed (توسيع البحث)
binary images » binary image (توسيع البحث)
binary data » primary data (توسيع البحث), dietary data (توسيع البحث)
data joint » data point (توسيع البحث), data points (توسيع البحث)
designed optimization » design optimization (توسيع البحث), based optimization (توسيع البحث), guided optimization (توسيع البحث)
joint optimization » policy optimization (توسيع البحث), wolf optimization (توسيع البحث), codon optimization (توسيع البحث)
images designed » scales designed (توسيع البحث)
binary images » binary image (توسيع البحث)
binary data » primary data (توسيع البحث), dietary data (توسيع البحث)
data joint » data point (توسيع البحث), data points (توسيع البحث)
-
1
-
2
-
3
Sample image for illustration.
منشور في 2024"…Furthermore, the matching score for the test image is 0.975. The computation time for CBFD is 2.8 ms, which is at least 6.7% lower than that of other algorithms. …"
-
4
Quadratic polynomial in 2D image plane.
منشور في 2024"…Furthermore, the matching score for the test image is 0.975. The computation time for CBFD is 2.8 ms, which is at least 6.7% lower than that of other algorithms. …"
-
5
Supplementary Material for: Penalized Logistic Regression Analysis for Genetic Association Studies of Binary Phenotypes
منشور في 2022"…Introduction: Increasingly, logistic regression methods for genetic association studies of binary phenotypes must be able to accommodate data sparsity, which arises from unbalanced case-control ratios and/or rare genetic variants. …"
-
6
Comparison analysis of computation time.
منشور في 2024"…Furthermore, the matching score for the test image is 0.975. The computation time for CBFD is 2.8 ms, which is at least 6.7% lower than that of other algorithms. …"
-
7
Process flow diagram of CBFD.
منشور في 2024"…Furthermore, the matching score for the test image is 0.975. The computation time for CBFD is 2.8 ms, which is at least 6.7% lower than that of other algorithms. …"
-
8
Precision recall curve.
منشور في 2024"…Furthermore, the matching score for the test image is 0.975. The computation time for CBFD is 2.8 ms, which is at least 6.7% lower than that of other algorithms. …"
-
9
Fortran & C++: design fractal-type optical diffractive element
منشور في 2022"…</p> <p>(2) calculate diffraction fields for fractal and/or grid-matrix (binary) phase-holograms.</p> <p>(3) optimize the fractal and/or grid-matrix holograms for given target diffraction images, using annealing algorithms. …"
-
10
Thesis-RAMIS-Figs_Slides
منشور في 2024"…<br><br>Finally, although the developed concepts, ideas and algorithms have been developed for inverse problems in geostatistics, the results are applicable to a wide range of disciplines where similar sampling problems need to be faced, included but not limited to design of communication networks, optimal integration and communication of swarms of robots and drones, remote sensing.…"
-
11
Data_Sheet_1_Multiclass Classification Based on Combined Motor Imageries.pdf
منشور في 2020"…And we propose two new multilabel uses of the Common Spatial Pattern (CSP) algorithm to optimize the signal-to-noise ratio, namely MC2CMI and MC2SMI approaches. …"
-
12
Variable Selection with Multiply-Imputed Datasets: Choosing Between Stacked and Grouped Methods
منشور في 2022"…Building on existing work, we (i) derive and implement efficient cyclic coordinate descent and majorization-minimization optimization algorithms for continuous and binary outcome data, (ii) incorporate adaptive shrinkage penalties, (iii) compare these methods through simulation, and (iv) develop an R package <i>miselect</i>. …"