Results of Holm’s step-down procedure. حسب Nebojsa Bacanin (13932723)

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

Validation of image processing steps and metric results using images of a microfluidic device. حسب Gavrielle R. Untracht (11820311)

Hierarchical clustering to infer a binary tree with <i>K</i> = 4 sampled populations. حسب Tristan Mary-Huard (3864)

Application of ABC SMC to the fitting of the binary flip with cusp model. حسب Elena Camacho-Aguilar (10906327)

A new fast filtering algorithm for a 3D point cloud based on RGB-D information حسب Chaochuan Jia (7256237)

"…Then, the optimal segmentation threshold of the V image that is calculated by using the Otsu algorithm is applied to segment the color mapping image into a binary image, which is used to extract the valid point cloud from the original point cloud with outliers. …"

Flowchart of software workflow. حسب Gavrielle R. Untracht (11820311)

GSE96058 information. حسب Sepideh Zununi Vahed (9861298)

"…Subsequently, feature selection was conducted using ANOVA and binary Particle Swarm Optimization (PSO). During the analysis phase, the discriminative power of the selected features was evaluated using machine learning classification algorithms. …"

The performance of classifiers. حسب Sepideh Zununi Vahed (9861298)

"…Subsequently, feature selection was conducted using ANOVA and binary Particle Swarm Optimization (PSO). During the analysis phase, the discriminative power of the selected features was evaluated using machine learning classification algorithms. …"

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

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

Segmentation, trace denoising and spike extraction framework. حسب Changjia Cai (10647521)

Presentation_1_Modified GAN Augmentation Algorithms for the MRI-Classification of Myocardial Scar Tissue in Ischemic Cardiomyopathy.PPTX حسب Umesh C. Sharma (10785063)

"…Currently, there are no optimized deep-learning algorithms for the automated classification of scarred vs. normal myocardium. …"

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

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

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

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

Thesis-RAMIS-Figs_Slides حسب Felipe Santibañez-Leal (10967991)

"…<br><br>Although the presented work was focused on 2-D binary channelized structures (geological facies), the applied principles are general and it can be extended to the characterization and recovery of other geological signals with spatial structure in under sampling contexts. …"

Image1_Applying the Hubbard-Stratonovich Transformation to Solve Scheduling Problems Under Inequality Constraints With Quantum Annealing.TIF حسب Sizhuo Yu (11429743)

"…Its current hardware implementation relies on D-Wave’s Quantum Processing Units, which are limited in terms of number of qubits and architecture while being restricted to solving quadratic unconstrained binary optimization (QUBO) problems. …"

Image3_Applying the Hubbard-Stratonovich Transformation to Solve Scheduling Problems Under Inequality Constraints With Quantum Annealing.TIF حسب Sizhuo Yu (11429743)

"…Its current hardware implementation relies on D-Wave’s Quantum Processing Units, which are limited in terms of number of qubits and architecture while being restricted to solving quadratic unconstrained binary optimization (QUBO) problems. …"