The genetic algorithm. حسب Viktoria Zemliak (19500335)

Metrics of the complex network algorithm. حسب Xumei Pan (21464351)

الموضوعات:

An overview of the organization of the study program. حسب Marialuisa Gandolfi (8639238)

الموضوعات:

Overview of the development of the biomarkers in the motor, exteroceptive, interoceptive, and cerebral domains. حسب Marialuisa Gandolfi (8639238)

الموضوعات:

The schedule of enrolment, interventions, and assessments. حسب Marialuisa Gandolfi (8639238)

الموضوعات:

Excerpts from the raw acquired data set with the tracking algorithm. حسب Hannes Benecke (17409369)

الموضوعات:

Dataset for Fine-Tuning Code Generation Models: Kannada-English Algorithmic Statements and Python Code حسب Goutami Sooda (20714729)

A sinogram of the test sample before and after the dejitter algorithm. حسب Hannes Benecke (17409369)

الموضوعات:

Data and code resources. حسب Sam Hall-McMaster (10343795)

Presents the comparison of various density based algorithms. حسب Shahneela Pitafi (20454775)

Statistical details of data presented in Fig 16. حسب Piotr Popik (292215)

"…DeepSqueak toolkit was used to examine USVs. Deep learning algorithms revealed lights-off-induced increases in fighting, mounting, crawling, and rearing behaviors, as well as 22-kHz alarm calls and 50-kHz flat and short, but not frequency-modulated calls. …"

Statistical details of data presented in Fig 17. حسب Piotr Popik (292215)

"…DeepSqueak toolkit was used to examine USVs. Deep learning algorithms revealed lights-off-induced increases in fighting, mounting, crawling, and rearing behaviors, as well as 22-kHz alarm calls and 50-kHz flat and short, but not frequency-modulated calls. …"

Present an algorithm to prove P = NP حسب Sang-un Lee (22242910)

"…NP problem, a long-standing challenge in computer science, we present a novel deterministic algorithm that solves the Hamiltonian path problem, a representative NP-complete problem, in polynomial time. …"

Present an algorithm to prove P = NP حسب Sang-un Lee (22242148)

"…NP problem, a long-standing challenge in computer science, we present a novel deterministic algorithm that solves the Hamiltonian path problem, a representative NP-complete problem, in polynomial time. …"

Present an algorithm to prove P = NP حسب Sang-un Lee (22242055)

"…NP problem, a long-standing challenge in computer science, we present a novel deterministic algorithm that solves the Hamiltonian path problem, a representative NP-complete problem, in polynomial time. …"

ML algorithms used in this study. حسب Toheeb Salahudeen (21368040)

The mAP for all algorithms and 80% of the data used for training. حسب Mohammad Amin Fraiwan (20469541)

The mAP for all algorithms and 50% of the data used for training. حسب Mohammad Amin Fraiwan (20469541)

The mAP for all algorithms and 60% of the data used for training. حسب Mohammad Amin Fraiwan (20469541)

Analysis of single features of vehicle movement. حسب Yaqin He (4627711)