Showing 1 - 12 results of 12 for search '(( binary data resources utilisation algorithm ) OR ( binary time scale optimization algorithm ))', query time: 0.55s Refine Results
  1. 1
  2. 2
  3. 3
  4. 4
  5. 5

    Comparison analysis of computation time. by Indhumathi S. (19173013)

    Published 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. …”
  6. 6

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

    Published 2019
    “…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. …”
  7. 7

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

    Published 2022
    “…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. …”
  8. 8

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

    Published 2019
    “…Our results suggest an improved scaling over the other algorithms for fully connected problems of average difficulty with bimodal disorder. …”
  9. 9

    Sample image for illustration. by Indhumathi S. (19173013)

    Published 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. …”
  10. 10

    Process flow diagram of CBFD. by Indhumathi S. (19173013)

    Published 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. …”
  11. 11

    Precision recall curve. by Indhumathi S. (19173013)

    Published 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. …”
  12. 12

    Quadratic polynomial in 2D image plane. by Indhumathi S. (19173013)

    Published 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. …”