ViewTube

ViewTube
Sign inSign upSubscriptions
Filters

Upload date

Type

Duration

Sort by

Features

Reset

239 results

Railways | Retro Tech | DIY
I Got Tired of Google Maps... So I Built My Own

Ever wondered how navigation apps like Google Maps actually work? In this video, I break down the entire routing process in a ...

31:23
I Got Tired of Google Maps... So I Built My Own

90,581 views

1 month ago

Codegram
How to write a search engine in 15 lines of code (Paul Chiusano) - Full Stack Fest 2016

Unison is a new programming language and platform. This talk zooms in on just one aspect of Unison: its support for building ...

36:05
How to write a search engine in 15 lines of code (Paul Chiusano) - Full Stack Fest 2016

8,077 views

9 years ago

Jon Gjengset
Crust of Rust: std::collections

In this video we go over the various collection types in the Rust standard library (effectively `std::collections`), and discuss a bit ...

2:45:04
Crust of Rust: std::collections

84,989 views

2 years ago

Jon Gjengset
Implementing and Optimizing a Wordle Solver in Rust

We implement a Wordle solver in Rust based off on the excellent 3blue1brown video on the same topic: ...

6:08:52
Implementing and Optimizing a Wordle Solver in Rust

160,001 views

3 years ago

Jon Gjengset
Crust of Rust: Sorting Algorithms

In this Crust of Rust episode, we implement some common sorting algorithms in Rust. This episode doesn't aim to explain any ...

2:37:53
Crust of Rust: Sorting Algorithms

67,023 views

5 years ago

nptelhrd
Mod-06 Lec-07 Warshall's algorithm

Discrete Mathematics by Dr. Sugata Gangopadhyay & Dr. Aditi Gangopadhyay,Department of Mathematics,IIT Roorkee.For more ...

1:03:17
Mod-06 Lec-07 Warshall's algorithm

2,848 views

10 years ago

Jon Gjengset
Implementing Hazard Pointers in Rust

This time, we take a stab at implementing Hazard Pointers (https://erdani.org/publications/cuj-2004-12.pdf) in Rust. We follow ...

4:55:09
Implementing Hazard Pointers in Rust

38,169 views

4 years ago

NPTEL IIT Bombay
Week 11: Lecture 43: FedAvg Algorithm

FedAvg Algorithm.

22:27
Week 11: Lecture 43: FedAvg Algorithm

1,318 views

1 year ago

Jon Gjengset
Lock-Free to Wait-Free Simulation in Rust

In this stream, we start implementing the concurrency algorithm from the academic paper "A Practical Wait-Free Simulation for ...

4:47:58
Lock-Free to Wait-Free Simulation in Rust

49,811 views

4 years ago

Confreaks
RubyConf 2015 - Shall We Play A Game? by Randy Coulman

Shall We Play A Game? by Randy Coulman Teaching computers to play games has been a pursuit and passion for many ...

37:25
RubyConf 2015 - Shall We Play A Game? by Randy Coulman

342 views

10 years ago

José A. Alonso
El patrón de búsqueda en escalada en Haskell

Implementación en Haskell del patrón en escalada en espacios de estados y su aplicación al problema del cambio de monedas.

36:20
El patrón de búsqueda en escalada en Haskell

179 views

5 years ago

Tyler Caraza-Harter
CS 320 Oct 7 (Part 1) - BFS Backtrace

... we return true right we found a path now there are two things i want to fix about this today um one is that the code isn't quite right ...

26:25
CS 320 Oct 7 (Part 1) - BFS Backtrace

261 views

5 years ago

NPTEL IIT Bombay
Week 5 : Lecture 22 : Tutorial Session - 4: Python implementation of Jacobi Method

Lecture 22 : Tutorial Session - 4: Python implementation of Jacobi Method.

38:27
Week 5 : Lecture 22 : Tutorial Session - 4: Python implementation of Jacobi Method

5,255 views

2 years ago

Tyler Caraza-Harter
CS 320 Oct 5 (Part 2) - DFS

... seems good i think that this code is correct this is a depth first search depth first search yay we did it um very useful algorithm um ...

27:25
CS 320 Oct 5 (Part 2) - DFS

314 views

5 years ago

NPTEL IIT Bombay
Lecture 9 : Loops in various applications Part 4 : Simulating a water tank

Loops in various applications Part 4 : Simulating a water tank.

20:22
Lecture 9 : Loops in various applications Part 4 : Simulating a water tank

6,874 views

6 years ago

NPTEL IIT Bombay
Lecture 19A: Line search methods for unconstrained optimization

Week 10: Lecture 19A: Line search methods for unconstrained optimization.

21:19
Lecture 19A: Line search methods for unconstrained optimization

10,900 views

4 years ago

Tyler Caraza-Harter
CS 320 Oct 12 (Part 2) - Breadth-First Search for Web

... directed acyclic graph and i may write some breadth first uh search code uh to explore it so i'm actually gonna be working on my ...

29:13
CS 320 Oct 12 (Part 2) - Breadth-First Search for Web

376 views

5 years ago

CSU Mathematics
Walks and Adjacency Matrices

In this video we discuss walks on a graph, counting the number of walks, and a graph storage structure called an adjacency matrix ...

34:25
Walks and Adjacency Matrices

1,978 views

4 years ago

Jeremy Howard
Lesson 9: Deep Learning Foundations to Stable Diffusion

All lesson resources are available at http://course.fast.ai.) This is the first lesson of part 2 of Practical Deep Learning for Coders.

2:15:16
Lesson 9: Deep Learning Foundations to Stable Diffusion

171,352 views

3 years ago

ao iti
One pathfinder to solve them all!Code pathfinding for grid or node based movements (Tilemap example)

Here is a tutorial for coding your own pathfinding solution into your Unity projects. This pathfinder class will be adaptable to any ...

24:56
One pathfinder to solve them all!Code pathfinding for grid or node based movements (Tilemap example)

2,653 views

3 years ago