Homomorphic binary tree. حسب Jianhua He (341366)

Optimization of tracking parameters based on <i>P</i>_<i>swap</i>. حسب Benjamin Gallois (10131683)

Microsoft excel file containing exhaustive list of Abbreviated-Injury Scale codes used to generate binary variables encoding the presence or absence of injury to various body regio... حسب Michael D. Cobler-Lichter (22492930)

Fig 3 - حسب Ali Ahmed (2567584)

Comparison analysis of computation time. حسب Indhumathi S. (19173013)

"…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. …"

Improved support vector machine classification algorithm based on adaptive feature weight updating in the Hadoop cluster environment حسب Jianfang Cao (1881379)

"…The MapReduce parallel programming model on the Hadoop platform is used to perform an adaptive fusion of hue, local binary pattern (LBP) and scale-invariant feature transform (SIFT) features extracted from images to derive optimal combinations of weights. …"

Data_Sheet_1_A real-time driver fatigue identification method based on GA-GRNN.ZIP حسب Xiaoyuan Wang (492534)

"…In this paper, a non-invasive and low-cost method of fatigue driving state identification based on genetic algorithm optimization of generalized regression neural network model is proposed. …"

Data_Sheet_1_Physics-Inspired Optimization for Quadratic Unconstrained Problems Using a Digital Annealer.pdf حسب Maliheh Aramon (6557906)

"…Our results suggest an improved scaling over the other algorithms for fully connected problems of average difficulty with bimodal disorder. …"

Sample image for illustration. حسب Indhumathi S. (19173013)

"…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. …"

Process flow diagram of CBFD. حسب Indhumathi S. (19173013)

"…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. …"

Precision recall curve. حسب Indhumathi S. (19173013)

"…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. …"

Quadratic polynomial in 2D image plane. حسب Indhumathi S. (19173013)

"…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. …"