Showing 1 - 20 results of 27 for search '(( binary b structural optimization algorithm ) OR ( binary image design optimization algorithm ))', query time: 0.45s Refine Results
  1. 1
  2. 2
  3. 3
  4. 4
  5. 5
  6. 6
  7. 7

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

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

    Algoritmo de clasificación de expresiones de odio por tipos en español (Algorithm for classifying hate expressions by type in Spanish) by Daniel Pérez Palau (11097348)

    Published 2024
    “…</li></ul><p dir="ltr"><b>File Structure</b></p><p dir="ltr">The code generates and saves:</p><ul><li>Weights of the trained model (.h5)</li><li>Configured tokenizer</li><li>Training history in CSV</li><li>Requirements file</li></ul><p dir="ltr"><b>Important Notes</b></p><ul><li>The model excludes category 2 during training</li><li>Implements transfer learning from a pre-trained model for binary hate detection</li><li>Includes early stopping callbacks to prevent overfitting</li><li>Uses class weighting to handle category imbalances</li></ul><p dir="ltr">The process of creating this algorithm is explained in the technical report located at: Blanco-Valencia, X., De Gregorio-Vicente, O., Ruiz Iniesta, A., & Said-Hung, E. (2025). …”
  12. 12
  13. 13
  14. 14
  15. 15
  16. 16

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

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

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

    Fortran & C++: design fractal-type optical diffractive element by I-Lin Ho (13768960)

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