stanford-online
Here are 35 public repositories matching this topic...
Language:All
Sort:Most stars
A simple tool to download video lectures from edx.org (and other openedx sites)
- Updated
Oct 11, 2023 - HTML
an Open Course Platform for Stanford CS224n (2020 Winter)
- Updated
May 3, 2024 - JavaScript
My Solutions of Assignments of CS234: Reinforcement Learning Winter 2019
- Updated
Mar 24, 2023 - Python
Coursera, Edx and other MOOCs Certificates
- Updated
Apr 20, 2020
Repo for Statistical Learning course offered by Stanford University
- Updated
Aug 25, 2019 - HTML
A Tensorflow retrieval (space embedding) baseline. Metric learning baseline on CUB and Stanford Online Products.
- Updated
Oct 9, 2021 - Python
Algorithms - Design and Analysis offered by Stanford University
- Updated
Feb 26, 2020
Swift UI features and general iOS/iPadOS/macOS development coding lab
- Updated
Mar 8, 2024 - Swift
My solutions forhttps://www.coursera.org/learn/unsupervised-learning-recommenders-reinforcement-learning
- Updated
Aug 15, 2022 - Jupyter Notebook
Repo for the Databases courses provided by Stanford Universityhttps://lagunita.stanford.edu/courses
- Updated
Feb 22, 2020 - TSQL
Stanford CS234, 2018
- Updated
Mar 23, 2018 - Python
My solutions forhttps://www.coursera.org/learn/machine-learning?id=285
- Updated
Aug 15, 2022 - Jupyter Notebook
My solutions forhttps://www.coursera.org/learn/advanced-learning-algorithms
- Updated
Aug 15, 2022 - Jupyter Notebook
Compiler for the Classroom Object-Oriented Language (Stanford CS143, 2021)
- Updated
Mar 14, 2021 - Java
Machine Learning by Stanford University
- Updated
Jul 17, 2017 - MATLAB
An Algorithm for computing a max-spacing -k-clustering.
- Updated
Nov 19, 2018 - Python
Assignment for Week 4 of Machine Learning by Andrew Ng @ Stanford Uni
- Updated
Aug 17, 2017 - MATLAB
computing strongly connected components using kosaraju's two path algorithm
- Updated
Aug 12, 2018 - Python
An implementation for Prim's minimum spanning tree algorithm using heaps
- Updated
Sep 28, 2018 - Python
An implementation of dynamic programming algorithm for computing a maximum-weight independent set of a path graph
- Updated
Nov 20, 2018 - Python
Improve this page
Add a description, image, and links to thestanford-online topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with thestanford-online topic, visit your repo's landing page and select "manage topics."