Search alternatives:
codon optimization » wolf optimization (Expand Search)
2_an optimization » _ optimization (Expand Search), lead optimization (Expand Search), ai optimization (Expand Search)
primary data » primary care (Expand Search)
image 2_an » image 2_a (Expand Search), image 2_case (Expand Search)
data codon » data code (Expand Search), data codes (Expand Search), data codings (Expand Search)
codon optimization » wolf optimization (Expand Search)
2_an optimization » _ optimization (Expand Search), lead optimization (Expand Search), ai optimization (Expand Search)
primary data » primary care (Expand Search)
image 2_an » image 2_a (Expand Search), image 2_case (Expand Search)
data codon » data code (Expand Search), data codes (Expand Search), data codings (Expand Search)
-
1
A* Path-Finding Algorithm to Determine Cell Connections
Published 2025“…</p><p dir="ltr">Astrocytes were dissociated from E18 mouse cortical tissue, and image data were processed using a Cellpose 2.0 model to mask nuclei. …”
-
2
-
3
-
4
-
5
-
6
-
7
-
8
-
9
Data_Sheet_1_Pneumonia detection by binary classification: classical, quantum, and hybrid approaches for support vector machine (SVM).pdf
Published 2024“…A support vector machine (SVM) is attractive because binary classification can be represented as an optimization problem, in particular as a Quadratic Unconstrained Binary Optimization (QUBO) model, which, in turn, maps naturally to an Ising model, thereby making annealing—classical, quantum, and hybrid—an attractive approach to explore. …”
-
10
-
11
-
12
Quadratic polynomial in 2D image plane.
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. …”
-
13
-
14
-
15
Sample image for illustration.
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. …”
-
16
Presentation_1_Modified GAN Augmentation Algorithms for the MRI-Classification of Myocardial Scar Tissue in Ischemic Cardiomyopathy.PPTX
Published 2021“…Currently, there are no optimized deep-learning algorithms for the automated classification of scarred vs. normal myocardium. …”
-
17
Comparison analysis of computation time.
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
Process flow diagram of CBFD.
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
Precision recall curve.
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. …”
-
20
PathOlOgics_RBCs Python Scripts.zip
Published 2023“…</p><p dir="ltr">In terms of classification, a second algorithm was developed and employed to preliminary sort or group the individual cells (after excluding the overlapping cells manually) into different categories using five geometric measurements applied to the extracted contour from each binary image mask (see PathOlOgics_script_2; preliminary shape measurements). …”