ViewTube

ViewTube
Sign inSign upSubscriptions
Filters

Upload date

Type

Duration

Sort by

Features

Reset

6 results

Prajal Danai
ST5008CEM Programming for Developers-CourseWork

This video is part of my Programming for Developers (STW5008CEM) coursework where I implement and explain several Data ...

18:54
ST5008CEM Programming for Developers-CourseWork

0 views

9 days ago

Abhishek Mishra – Mathematics & TCS
DAA 18 (Part 2) – Ford–Fulkerson Worked Example | Maximum Flow and Minimum Cut | CS F364

This lecture is DAA 18 (Part 2) in the Design and Analysis of Algorithms (DAA) course (CS F364). It presents a complete worked ...

26:11
DAA 18 (Part 2) – Ford–Fulkerson Worked Example | Maximum Flow and Minimum Cut | CS F364

80 views

1 month ago

Abhishek Mishra – Mathematics & TCS
DAA 20 (Part 2) – Edge-Disjoint Paths Worked Examples (Directed & Undirected) | CS F364

The lecture carefully demonstrates how to: Identify augmenting paths Construct the residual graph Perform flow augmentation ...

40:51
DAA 20 (Part 2) – Edge-Disjoint Paths Worked Examples (Directed & Undirected) | CS F364

71 views

2 weeks ago

UCFCompArch
Efficient Algorithm-Hardware Co-Design Methodology for Quantized LLM Acceleration

Abstract: As the silicon technology approaches the Post-Moore's Law Era, hardware specialization has become increasingly ...

1:04:13
Efficient Algorithm-Hardware Co-Design Methodology for Quantized LLM Acceleration

42 views

4 days ago

Abhishek Mishra – Mathematics & TCS
DAA 18 (Part 1) – Max Flow Min Cut Theorem & Proof | Ford–Fulkerson Analysis | CS F364

This lecture is DAA 18 (Part 1) in the Design and Analysis of Algorithms (DAA) course (CS F364). It presents a detailed proof of the ...

49:34
DAA 18 (Part 1) – Max Flow Min Cut Theorem & Proof | Ford–Fulkerson Analysis | CS F364

95 views

1 month ago

Gate Rankers by Dr. Prity Rani
Lec 46:  Ford Fulkerson Algorithm Pseudocode | Time Complexity Analysis
11:06
Lec 46: Ford Fulkerson Algorithm Pseudocode | Time Complexity Analysis

20 views

5 days ago