One advantage of our algorithm is that it is not binary in nature. by Yong Kuk Kim (13955214)

Illustration of the transformed binary images of normal, benign, and malignant samples into grayscale. by Tehnan I. A. Mohamed (16846175)

Related Work Summary. by Hend Bayoumi (22693738)

Homomorphic binary tree. by Jianhua He (341366)

A* Path-Finding Algorithm to Determine Cell Connections by Max Weng (22327159)

“…Future work aims to generalize this algorithm for broader biological applications by training additional Cellpose models and adapting the A* framework.…”

Random forest model performs better than support vector machine algorithms and when it primarily uses spontaneous photopic ERG of 60-s duration in humans. by Ramsés Noguez Imm (6658637)

Sample image for illustration. by 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. …”

Triplet Matching for Estimating Causal Effects With Three Treatment Arms: A Comparative Study of Mortality by Trauma Center Level by Giovanni Nattino (561797)

“…Our algorithm outperforms the nearest neighbor algorithm and is shown to produce matched samples with total distance no larger than twice the optimal distance. …”

Quadratic polynomial in 2D image plane. by 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. …”

Optimal Timings Codebook.xlsx by Emma Spillane (11249121)

Analysis and design of algorithms for the manufacturing process of integrated circuits by Sonia Fleytas (16856403)

“…The (approximate) solution proposals of state-of-the-art methods include rule-based approaches, genetic algorithms, and reinforcement learning. …”

Optimal Time Intervals of Breech Births Dataset by Emma Spillane (11249121)

Comparison analysis of computation time. by 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. by 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. by 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. …”

Symmetry test result. by Jiyong Moon (16819302)

Spontaneous ERG-based random forest model discriminates control and disease cases in rodent models of obesity and type 1 diabetes and predicts disease evolution in the type 1 diabe... by Ramsés Noguez Imm (6658637)

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

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

DataSheet_1_Raman Spectroscopic Differentiation of Streptococcus pneumoniae From Other Streptococci Using Laboratory Strains and Clinical Isolates.pdf by Marcel Dahms (9160118)

“…Improvement of the classification rate is expected with optimized model parameters and algorithms as well as with a larger spectral data base for training.…”

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

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