Computer Engineering student - AI and Data Analytics track
-
EURECOM
- Sophia Antipolis (FR)
- @mattyred99
Pinned Loading
-
BSGP_Automatic_Independence_Determination
BSGP_Automatic_Independence_Determination PublicForked from srossi93/Sparse-Gaussian-Processes-Revisited
Jupyter Notebook
-
La-Casette/malicious_pdf_detection
La-Casette/malicious_pdf_detection PublicThis project compares the performance of K-Nearest Neighbors, Support Vector Machines, and Decision Trees models for detecting malicious PDF files, with an emphasis on optimizing model performance …
-
The-buggers/polito_sdp_21-22_A_star_path_finding
The-buggers/polito_sdp_21-22_A_star_path_finding PublicA* is a graph-traversal and path-search algorithm. It is used in many contexts of computer science and not only. It can be considered as a general case of the Dijkstra algorithm.
TeX 1
Something went wrong, please refresh the page to try again.
If the problem persists, check the GitHub status page or contact support.
If the problem persists, check the GitHub status page or contact support.