Search alternatives:
codon optimization » wolf optimization (Expand Search)
task optimization » based optimization (Expand Search), phase optimization (Expand Search), path optimization (Expand Search)
binary basic » binary mask (Expand Search)
binary score » binary scoring (Expand Search), injury score (Expand Search)
basic codon » basic column (Expand Search)
score task » core task (Expand Search), score test (Expand Search), scale task (Expand Search)
Showing 1 - 8 results of 8 for search '(( binary basic codon optimization algorithm ) OR ( binary score task optimization algorithm ))', query time: 0.33s Refine Results
  1. 1
    F-score values of IRBMO vs. other binary algorithms.

    F-score values of IRBMO vs. other binary algorithms. by Chenyi Zhu (9383370)

    Published 2025
    Save to List
    Saved in:
  2. 2
    Sample image for illustration.

    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. …”
    Save to List
    Saved in:
  3. 3
    Comparison analysis of computation time.

    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. …”
    Save to List
    Saved in:
  4. 4
    Process flow diagram of CBFD.

    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. …”
    Save to List
    Saved in:
  5. 5
    Precision recall curve.

    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. …”
    Save to List
    Saved in:
  6. 6
    Quadratic polynomial in 2D image plane.

    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. …”
    Save to List
    Saved in:
  7. 7
    Flowchart scheme of the ML-based model.

    Flowchart scheme of the ML-based model. by Noshaba Qasmi (20405009)

    Published 2024
    Save to List
    Saved in:
  8. 8
    Table 1_Creating an interactive database for nasopharyngeal carcinoma management: applying machine learning to evaluate metastasis and survival.docx

    Table 1_Creating an interactive database for nasopharyngeal carcinoma management: applying machine learning to evaluate metastasis and survival.docx by Yanbo Sun (2202439)

    Published 2024
    “…For the survival prediction tasks of OS and CSS, we constructed 45 combinations using nine survival machine learning algorithms. …”
    Save to List
    Saved in:

Search Tools: