Graph connectivity | Graph algorithms
In computer science, Kosaraju-Sharir's algorithm (also known as Kosaraju's algorithm) is a linear time algorithm to find the strongly connected components of a directed graph. Aho, Hopcroft and Ullman credit it to S. Rao Kosaraju and Micha Sharir. Kosaraju suggested it in 1978 but did not publish it, while Sharir independently discovered it and published it in 1981. It makes use of the fact that the transpose graph (the same graph with the direction of every edge reversed) has exactly the same strongly connected components as the original graph. (Wikipedia).
Kolmogorov Complexity - Applied Cryptography
This video is part of an online course, Applied Cryptography. Check out the course here: https://www.udacity.com/course/cs387.
From playlist Applied Cryptography
Improved List-Decoding and Local List-Decoding Algorithms for Polynomial Codes - Swastik Kopparty
More videos on http://video.ias.edu
From playlist Mathematics
How to Train a Robot Arm - A New Method
In this video, I discuss the paper "Asymmetric self-play for automatic goal discovery in robotic manipulation," which describes an effective reinforcement learning method for training robots in simulation by using self-play (robot vs robot). One robot's goal is to move the objects around i
From playlist Machine Learning
List-Decoding Multiplicity Codes - Swastik Kopparty
Swastik Kopparty Rutgers University April 10, 2012 We study the list-decodability of multiplicity codes. These codes, which are based on evaluations of high-degree polynomials and their derivatives, have rate approaching 1 while simultaneously allowing for sublinear-time error-correction.
From playlist Mathematics
Koopman Spectral Analysis (Representations)
In this video, we explore how to obtain finite-dimensional representations of the Koopman operator from data, using regression. This includes the use of sparse regression and neural networks, and highlights the importance of cross-validating. https://www.eigensteve.com/
From playlist Koopman Analysis
Higher-order Runge-Kutta Methods | Lecture 52 | Numerical Methods for Engineers
A discussion of higher-order Runge-Kutta methods, including the popular fourth-order method. Join me on Coursera: https://www.coursera.org/learn/numerical-methods-engineers Lecture notes at http://www.math.ust.hk/~machas/numerical-methods-for-engineers.pdf Subscribe to my channel: http
From playlist Numerical Methods for Engineers
Kolmogorov Complexity Solution - Applied Cryptography
This video is part of an online course, Applied Cryptography. Check out the course here: https://www.udacity.com/course/cs387.
From playlist Applied Cryptography
Centrality - Intro to Algorithms
This video is part of an online course, Intro to Algorithms. Check out the course here: https://www.udacity.com/course/cs215.
From playlist Introduction to Algorithms
From Fourier to Koopman: Spectral Methods for Long-term Time Series Prediction
PAPER: https://arxiv.org/abs/2004.00574 GITHUB: https://github.com/helange23/from_fourier_to_koopman This video discusses a range of forecasting tools for time-series data. For long-term forecasting, using methods based upon Fourier modes, with adaptation using Koopman theory, gives an
From playlist Research Abstracts from Brunton Lab
What Is An Algorithm? | What Exactly Is Algorithm? | Algorithm Basics Explained | Simplilearn
This video explains what is an algorithm in the data structure. This Simplilearn's What Is An Algorithm? tutorial will help beginners to understand what exactly is an algorithm with an example. All of the algorithm basics are explained in this video. Following topics covered in this vi
From playlist Data Structures & Algorithms [2022 Updated]
Sorting Algorithms Full Course | Sorting Algorithms In Data Structures Explained | Simplilearn
This Simplilearn video is based on The Sorting Algorithms Full Course. This tutorial mainly focuses on all the major Sorting Algorithms In Data Structures Explained with detailed theory and practical examples for providing a better learning experience. This video covers the following Sort
From playlist Simplilearn Live
Lecture 1 - Introduction to Algorithms
This is Lecture 1 of the CSE373 (Analysis of Algorithms) course taught by Professor Steven Skiena [http://www.cs.sunysb.edu/~skiena/] at Stony Brook University in 2007. The lecture slides are available at: http://www.cs.sunysb.edu/~algorith/video-lectures/2007/lecture1.pdf More informati
From playlist CSE373 - Analysis of Algorithms - 2007 SBU
Lecture 1 - Introduction to Algorithms
This is Lecture 1 of the CSE373 (Analysis of Algorithms) taught by Professor Steven Skiena [http://www.cs.sunysb.edu/~skiena/] at Stony Brook University in 1997. The lecture slides are available at: http://www.cs.sunysb.edu/~algorith/video-lectures/1997/lecture1.pdf
From playlist CSE373 - Analysis of Algorithms - 1997 SBU
What Is An Algorithm ? | Introduction to Algorithms | How To Write An Algorithm? | Simplilearn
This video is based on What Is An Algorithm ? The Introduction to Algorithms tutorial will explain to you How To Write An Algorithm? and it will cover the following topics ✅00:00- Introduction to Algorithms ✅01:46- What Is an Algorithm? The algorithm is a step-by-step procedure or set o
From playlist C++ Tutorial Videos
Koopman Operator Optimal Control
This video illustrates the use of the Koopman operator to simulate and control a nonlinear dynamical system using a linear dynamical system on an observable subspace. From the Paper: Koopman observable subspaces and finite linear representations of nonlinear dynamical systems for contro
From playlist Research Abstracts from Brunton Lab
Stanford Seminar - Participating and Designing around Algorithmic Sociotechnical Systems
Motahhare Eslami Carnegie Mellon University October 4, 2019 Algorithms play a vital role in curating online information in socio-technical systems, however, they are usually housed in black-boxes that limit users' understanding of how an algorithmic decision is made. While this opacity pa
From playlist Stanford Seminars