ViewTube

ViewTube
Sign inSign upSubscriptions
Filters

Upload date

Type

Duration

Sort by

Features

Reset

18 results

UofSC Discrete Mathematics Seminar
Joshua Cooper: The structure of maximal non-biconnected unit distance graphs in the plane

UofSC Discrete Mathematics Seminar April 09, 2021 Speaker: Joshua Cooper, University of South Carolina Title: The structure of ...

1:01:07
Joshua Cooper: The structure of maximal non-biconnected unit distance graphs in the plane

8 views

2d ago

UofSC Discrete Mathematics Seminar
Gregory Clark: Comparing the Spectral Ranking of a Hypergraph and its Shadow

UofSC Discrete Mathematics Seminar Date: April 01, 2022 Speaker: Gregory Clark, University of Oxford Title: Comparing the ...

59:21
Gregory Clark: Comparing the Spectral Ranking of a Hypergraph and its Shadow

7 views

1d ago

Vu Hung Nguyen (Hưng)
Minimum Spanning Tree: Visualising Kruskal's Greedy Algorithm and Cycle Detection

... software engineering students • Candidates preparing for algorithmic coding interviews • Visual learners exploring graph theory ...

0:35
Minimum Spanning Tree: Visualising Kruskal's Greedy Algorithm and Cycle Detection

2 views

2d ago

Vu Hung Nguyen (Hưng)
Convex Hull: Visualising Andrew's Monotone Chain and Graham's Scan

The Convex Hull of a set of 2D points P is the smallest convex polygon that encloses all points in P. Imagine nails hammered into ...

0:43
Convex Hull: Visualising Andrew's Monotone Chain and Graham's Scan

4 views

2d ago

Florian AZ
How to actually change your mind

Español: https://youtu.be/2qWJ66Dax7g Français: https://youtu.be/Yfds-6Oyyxg Deutsch: https://youtu.be/GaPSpBQOnqM Break ...

1:19
How to actually change your mind

41 views

3d ago

Vu Hung Nguyen (Hưng)
Traveling Salesperson Problem: Visualising 2-Opt and Held-Karp Dynamic Programming

... Candidates preparing for algorithmic coding interviews • Visual learners exploring graph theory and combinatorial optimisation ...

0:28
Traveling Salesperson Problem: Visualising 2-Opt and Held-Karp Dynamic Programming

5 views

2d ago

Mohammad bin Hossin
TMI3093 LU02 PART01 SECT I

Section I: Practice, Activities, and Unit Summary Consolidates the unit through conceptual stress-test questions, manual trace ...

8:30
TMI3093 LU02 PART01 SECT I

82 views

6d ago

TheChiptide
What if Every Starter Set Was Perfectly Fair?

... graph theory, today I'm going through every generation and rebalancing the starter types to make sure they are statistically fair!

24:55
What if Every Starter Set Was Perfectly Fair?

101,532 views

1d ago

Prépa Chimie
Representing the Result of a Curved Arrow (5/5)

A series of 5 videos on writing curved arrows in reaction mechanisms. In the course "Reactivity in Organic Chemistry": https ...

2:21
Representing the Result of a Curved Arrow (5/5)

27 views

5d ago

Mohammad bin Hossin
TMI3093 LU02 PART01 SECT F

Section F: Heuristic Functions Mastery Presents the mathematical conditions for heuristics—Admissibility, Consistency (triangle ...

9:18
TMI3093 LU02 PART01 SECT F

90 views

6d ago

Vu Hung Nguyen (Hưng)
Recursion Tree: Visualising Recursive Calls, Overlapping Subproblems, and Memoisation

Recursion is one of the most powerful and elegant ideas in computer science and mathematics, but how do recursive calls unfold ...

0:31
Recursion Tree: Visualising Recursive Calls, Overlapping Subproblems, and Memoisation

2 views

2d ago

Number Theory Web Seminar
Fernando Xuancheng Shao: Linear patterns in Piatetski–Shapiro primes (NTWS 301)

Abstract: The Green–Tao theorem shows that the primes contain arbitrarily long arithmetic progressions, and subsequent work ...

46:58
Fernando Xuancheng Shao: Linear patterns in Piatetski–Shapiro primes (NTWS 301)

166 views

5d ago

Vu Hung Nguyen (Hưng)
Network Flow: Visualising Ford-Fulkerson and the Max-Flow Min-Cut Theorem

The Maximum Flow problem determines the greatest volume of data, fluid, or traffic that can be routed from a designated source ...

0:30
Network Flow: Visualising Ford-Fulkerson and the Max-Flow Min-Cut Theorem

3 views

2d ago

Joseph Zambreno
10/05/26: Lect-06 (cont.)

... computation There there's some interesting theory you know behind all that Um it's been shown and proven that when you have ...

1:17:02
10/05/26: Lect-06 (cont.)

11 views

5d ago

Just Tim
Tableau 26.3: Desktop Gets Nothing, Cloud Gets Everything, but it makes sense.

Future-proof your career https://n1d.io ------- Tableau 26.3 just landed, and I still can't tell you where this product is actually ...

23:49
Tableau 26.3: Desktop Gets Nothing, Cloud Gets Everything, but it makes sense.

1,109 views

1d ago

RK TECH
Why AI Is Refusing To Give You Answers (The Learning Revolution) | Podcast Talk

Is the most effective way to study... to argue with an AI? In this episode of Podcast Talk, produced by Rithwik Tellakula, we break ...

18:29
Why AI Is Refusing To Give You Answers (The Learning Revolution) | Podcast Talk

3 views

6d ago

Descomplica
FUNCTIONS on ENEM 2026: only what you need to know about linear, quadratic, exponential, and log ...

Functions appear on the ENEM exam in everyday contexts: the cost of a ride-sharing app, the return on an investment, the ...

1:58:51
FUNCTIONS on ENEM 2026: only what you need to know about linear, quadratic, exponential, and log ...

5,228 views

Streamed 4d ago

mgcombes
The World Wide RAG Blueprint

THE WORLD WIDE RAG BLUEPRINT: DECENTRALIZED AI ARCHITECTURE Are central AI monopolies locking down human ...

55:19
The World Wide RAG Blueprint

5 views

18h ago