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

RMSE on the test data when fitting (logistic) quadratic models to binary data across increasing measurement error values . by Jakub Stoklosa (3315042)

Binary leaf image rotated anti-clock wise from the origin degree to 40^<i>o</i>, 80^<i>o</i>, 120^<i>o</i>, and 160^<i>o</i> from left to ri... by Ali Ahmed (2567584)

Microsoft excel file containing exhaustive list of Abbreviated-Injury Scale codes used to generate binary variables encoding the presence or absence of injury to various body regio... by Michael D. Cobler-Lichter (22492930)

Thesis-RAMIS-Figs_Slides by Felipe Santibañez-Leal (10967991)

“…<br><br>Finally, although the developed concepts, ideas and algorithms have been developed for inverse problems in geostatistics, the results are applicable to a wide range of disciplines where similar sampling problems need to be faced, included but not limited to design of communication networks, optimal integration and communication of swarms of robots and drones, remote sensing.…”

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

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

Fig 1 - by Jakub Stoklosa (3315042)

MCLP_quantum_annealer_V0.5 by Anonymous Anonymous (4854526)

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

Latent state estimations for experimental data with no stressors. by Samiul Alam (18563323)

Latent state estimations for experimental data with interruptions. by Samiul Alam (18563323)

Latent state estimations for experimental data with time limit. by Samiul Alam (18563323)

Latent state estimations for experimental data with interruptions for subject 18. by Samiul Alam (18563323)

Latent state estimations for experimental data with no stressors for subject 22. by Samiul Alam (18563323)

Latent state estimations for experimental data with no stressors for subject 17. by Samiul Alam (18563323)

Latent state estimations for experimental data with interruptions for subject 13. by Samiul Alam (18563323)

Latent state estimations for experimental data with no stressors for subject 3. by Samiul Alam (18563323)