Search alternatives:
values optimization » volume optimization (Expand Search), whale optimization (Expand Search), based optimization (Expand Search)
codes optimization » codon optimization (Expand Search), model optimization (Expand Search), convex optimization (Expand Search)
binary change » binary image (Expand Search)
binary data » primary data (Expand Search), dietary data (Expand Search)
data codes » data code (Expand Search), data models (Expand Search), data model (Expand Search)
values optimization » volume optimization (Expand Search), whale optimization (Expand Search), based optimization (Expand Search)
codes optimization » codon optimization (Expand Search), model optimization (Expand Search), convex optimization (Expand Search)
binary change » binary image (Expand Search)
binary data » primary data (Expand Search), dietary data (Expand Search)
data codes » data code (Expand Search), data models (Expand Search), data model (Expand Search)
-
1
-
2
-
3
-
4
-
5
-
6
-
7
Algoritmo de clasificación de expresiones de odio por tipos en español (Algorithm for classifying hate expressions by type in Spanish)
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). …”
-
8
-
9
-
10
Confusion matrix.
Published 2025“…Subsequently, we implement an optimal binary tree decision-making algorithm, grounded in dynamic programming, to achieve precise allocation of elastic resources within data streams, significantly bolstering resource utilization. …”
-
11
Parameter settings.
Published 2025“…Subsequently, we implement an optimal binary tree decision-making algorithm, grounded in dynamic programming, to achieve precise allocation of elastic resources within data streams, significantly bolstering resource utilization. …”
-
12
Event-driven data flow processing.
Published 2025“…Subsequently, we implement an optimal binary tree decision-making algorithm, grounded in dynamic programming, to achieve precise allocation of elastic resources within data streams, significantly bolstering resource utilization. …”
-
13
Dynamic resource allocation process.
Published 2025“…Subsequently, we implement an optimal binary tree decision-making algorithm, grounded in dynamic programming, to achieve precise allocation of elastic resources within data streams, significantly bolstering resource utilization. …”
-
14
Fortran & C++: design fractal-type optical diffractive element
Published 2022“…</p> <p>(4) export geometry/optics raw data and figures for binary DOE devices.</p> <p><br></p> <p>[Wolfram Mathematica code "square_triangle_DOE.nb"]:</p> <p>read the optimized binary DOE document (after Fortran & C++ code) to calculate its diffractive fields for comparison.…”