ViewTube

ViewTube
Sign inSign upSubscriptions
Filters

Upload date

Type

Duration

Sort by

Features

Reset

1,048 results

MIT OpenCourseWare
2. Divide & Conquer: Convex Hull, Median Finding

MIT 6.046J Design and Analysis of Algorithms, Spring 2015 View the complete course: http://ocw.mit.edu/6-046JS15 Instructor: ...

1:20:35
2. Divide & Conquer: Convex Hull, Median Finding

224,065 views

10 years ago

MIT OpenCourseWare
Lecture 1: Algorithmic Thinking, Peak Finding

MIT 6.006 Introduction to Algorithms, Fall 2011 View the complete course: http://ocw.mit.edu/6-006F11 Instructor: Srini Devadas ...

53:22
Lecture 1: Algorithmic Thinking, Peak Finding

5,914,278 views

13 years ago

Back To Back SWE
Asymptotic Notations 101: Big O, Big Omega, & Theta (Asymptotic Analysis Bootcamp)

Free 5-Day Mini-Course: https://backtobackswe.com Try Our Full Platform: https://backtobackswe.com/pricing Intuitive Video ...

23:16
Asymptotic Notations 101: Big O, Big Omega, & Theta (Asymptotic Analysis Bootcamp)

396,114 views

7 years ago

MIT OpenCourseWare
16. Complexity: P, NP, NP-completeness, Reductions

MIT 6.046J Design and Analysis of Algorithms, Spring 2015 View the complete course: http://ocw.mit.edu/6-046JS15 Instructor: ...

1:25:25
16. Complexity: P, NP, NP-completeness, Reductions

478,052 views

9 years ago

WIRED
Harvard Professor Explains Algorithms in 5 Levels of Difficulty | WIRED

From the physical world to the virtual world, algorithms are seemingly everywhere. David J. Malan, Professor of Computer Science ...

25:47
Harvard Professor Explains Algorithms in 5 Levels of Difficulty | WIRED

4,786,776 views

2 years ago

Simons Institute for the Theory of Computing
Faster High Accuracy Multi-Commodity Flows via Graph Techniques

... Algorithm Design In this talk, we will see that graph techniques can speed up algorithms for solving multi-commodity flow to high ...

45:26
Faster High Accuracy Multi-Commodity Flows via Graph Techniques

1,029 views

Streamed 2 years ago

PurpleMind
The Genius Way Computers Multiply Big Numbers | Karatsuba's Algorithm

To try everything Brilliant has to offer—free—for a full 30 days, visit https://brilliant.org/PurpleMind/ . You'll also get 20% off an ...

22:04
The Genius Way Computers Multiply Big Numbers | Karatsuba's Algorithm

558,361 views

1 year ago

ArjanCodes
Why Use Design Patterns When Python Has Functions?

Review code better and faster with my 3-Factor Framework: https://arjan.codes/diagnosis. In this video, I'll demonstrate that ...

23:23
Why Use Design Patterns When Python Has Functions?

142,334 views

2 years ago

MIT OpenCourseWare
Puzzle 7: Tile that Courtyard, Please

MIT 6.S095 Programming for the Puzzled, IAP 2018 View the complete course: https://ocw.mit.edu/6-S095IAP18 Instructor: Srini ...

28:02
Puzzle 7: Tile that Courtyard, Please

8,925 views

7 years ago

Abdul Bari
4.9 Longest Common Subsequence (LCS)  - Recursion and Dynamic Programming

Longest Common Subsequence Problem using 1. Recursion 2. Memoization 3. Dynamic Programming PATREON ...

23:35
4.9 Longest Common Subsequence (LCS) - Recursion and Dynamic Programming

1,458,277 views

7 years ago

Yegor Bugayenko
The Pain of OOP, Lecture #1: Algorithms

MIPT; 11 March 2020; Moscow, Russia Buy my book about OOP: http://goo.gl/W2WVMk See other lectures in this playlist: ...

1:08:55
The Pain of OOP, Lecture #1: Algorithms

13,906 views

5 years ago

Algorithmic Pattern
Laura Devendorf: Weaving algorithmic patterns with AdaCAD

Full info: https://algorithmicpattern.org/events/laura-devendorf/ Please click the youtube captions icon for human-made subtitles.

1:05:14
Laura Devendorf: Weaving algorithmic patterns with AdaCAD

959 views

Streamed 3 years ago

MIT OpenCourseWare
3. Divide & Conquer: FFT

MIT 6.046J Design and Analysis of Algorithms, Spring 2015 View the complete course: http://ocw.mit.edu/6-046JS15 Instructor: ...

1:20:52
3. Divide & Conquer: FFT

359,149 views

10 years ago

Fundamental Algorithms: Design and Analysis
Insertion Sort and Asymptotic Analysis

I mean if we design as a sorting algorithm and if you give it to somebody to purchase and you tell okay this is my sorting algorithm ...

29:52
Insertion Sort and Asymptotic Analysis

33,567 views

9 years ago

STMicroelectronics
Design Tips for Machine Learning algorithms generation (part 1)

Do you want to get started with AI based on decision trees? Do you want to understand how to optimize your decision tree?

22:33
Design Tips for Machine Learning algorithms generation (part 1)

1,978 views

4 years ago

Stanford University School of Engineering
How to design algorithms with fairness in mind

Subscribe to Stanford Engineering's The Future of Everything podcast: ...

26:30
How to design algorithms with fairness in mind

1,070 views

3 years ago

Improving
Usability and Empathy: Writing ADA Compliant Code - Improving Talks Series

Usability and Empathy: Writing ADA Compliant Code Web accessibility is on everyone's mind and provides us a unique ...

1:00:41
Usability and Empathy: Writing ADA Compliant Code - Improving Talks Series

59 views

5 years ago

Introduction to Algorithms and Analysis
Lecture 9 : Straseen's Algorithms

So, this divide and conquer technique is giving us order of n cube time algorithm which is not better as the standard method or ...

34:05
Lecture 9 : Straseen's Algorithms

9,084 views

8 years ago

Fundamental Algorithms: Design and Analysis
Van Emde Boas Data Structure

So before that what is the previous element in S, so this is the problem so for this problem we need to have a, we want to design a ...

28:57
Van Emde Boas Data Structure

7,878 views

9 years ago

Introduction to Algorithms and Analysis
mod12lec57

So, it is basically a powerful general powerful design techniques to solve the problems algorithmic design technique. So, basically ...

26:24
mod12lec57

2,685 views

8 years ago