بدائل البحث:
based optimization » whale optimization (توسيع البحث)
image bayesian » disease bayesian (توسيع البحث)
binary fast » binary mask (توسيع البحث)
fast based » test based (توسيع البحث), case based (توسيع البحث), art based (توسيع البحث)
based optimization » whale optimization (توسيع البحث)
image bayesian » disease bayesian (توسيع البحث)
binary fast » binary mask (توسيع البحث)
fast based » test based (توسيع البحث), case based (توسيع البحث), art based (توسيع البحث)
-
1
-
2
-
3
-
4
A new fast filtering algorithm for a 3D point cloud based on RGB-D information
منشور في 2019"…This method aligns the color image to the depth image, and the color mapping image is converted to an HSV image. Then, the optimal segmentation threshold of the V image that is calculated by using the Otsu algorithm is applied to segment the color mapping image into a binary image, which is used to extract the valid point cloud from the original point cloud with outliers. …"
-
5
Proposed Algorithm.
منشور في 2025"…To enhance the offloading decision-making process, the algorithm incorporates the Newton-Raphson method for fast and efficient optimization of the computation rate under energy constraints. …"
-
6
Comparisons between ADAM and NADAM optimizers.
منشور في 2025"…To enhance the offloading decision-making process, the algorithm incorporates the Newton-Raphson method for fast and efficient optimization of the computation rate under energy constraints. …"
-
7
Supplementary file 1_Comparative evaluation of fast-learning classification algorithms for urban forest tree species identification using EO-1 hyperion hyperspectral imagery.docx
منشور في 2025"…</p>Methods<p>Thirteen supervised classification algorithms were comparatively evaluated, encompassing traditional spectral/statistical classifiers—Maximum Likelihood, Mahalanobis Distance, Minimum Distance, Parallelepiped, Spectral Angle Mapper (SAM), Spectral Information Divergence (SID), and Binary Encoding—and machine learning algorithms including Decision Tree (DT), K-Nearest Neighbor (KNN), Support Vector Machine (SVM), Random Forest (RF), and Artificial Neural Network (ANN). …"
-
8
An Example of a WPT-MEC Network.
منشور في 2025"…To enhance the offloading decision-making process, the algorithm incorporates the Newton-Raphson method for fast and efficient optimization of the computation rate under energy constraints. …"
-
9
Related Work Summary.
منشور في 2025"…To enhance the offloading decision-making process, the algorithm incorporates the Newton-Raphson method for fast and efficient optimization of the computation rate under energy constraints. …"
-
10
Simulation parameters.
منشور في 2025"…To enhance the offloading decision-making process, the algorithm incorporates the Newton-Raphson method for fast and efficient optimization of the computation rate under energy constraints. …"
-
11
Training losses for N = 10.
منشور في 2025"…To enhance the offloading decision-making process, the algorithm incorporates the Newton-Raphson method for fast and efficient optimization of the computation rate under energy constraints. …"
-
12
Normalized computation rate for N = 10.
منشور في 2025"…To enhance the offloading decision-making process, the algorithm incorporates the Newton-Raphson method for fast and efficient optimization of the computation rate under energy constraints. …"
-
13
Summary of Notations Used in this paper.
منشور في 2025"…To enhance the offloading decision-making process, the algorithm incorporates the Newton-Raphson method for fast and efficient optimization of the computation rate under energy constraints. …"
-
14
Identification and quantitation of clinically relevant microbes in patient samples: Comparison of three k-mer based classifiers for speed, accuracy, and sensitivity
منشور في 2019"…We tested the accuracy, sensitivity, and resource requirements of three top metagenomic taxonomic classifiers that use fast k-mer based algorithms: Centrifuge, CLARK, and KrakenUniq. …"
-
15
Bayesian sequential design for sensitivity experiments with hybrid responses
منشور في 2023"…To deal with the problem of complex computation involved in searching for optimal designs, fast algorithms are presented using two strategies to approximate the optimal criterion, denoted as SI-optimal design and Bayesian D-optimal design, respectively. …"