Heap Sort - 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
We have seen an example of partitioning in the previous video. These partitioned sets are called equivalence sets or equivalence classes. In this video we look at some notation.
From playlist Abstract algebra
Quicksort 2 – Alternative Algorithm
This video describes the principle of the quicksort, which takes a ‘divide and conquer’ approach to the problem of sorting an unordered list. In this particular algorithm, the approach to partitioning a list does not rely on the explicit nomination of a pivot value, but still makes use of
From playlist Sorting Algorithms
This video describes the principle of the QuickSort. The quick sort is a divide and conquer algorithm which sorts a list by selecting a pivot value from the list, then placing other items on either side of the pivot depending on whether they are bigger or smaller. This results in three p
From playlist Sorting Algorithms
Discrete Math - 3.1.3 Sorting Algorithms
Bubble sort and insertion sort algorithms. Textbook: Rosen, Discrete Mathematics and Its Applications, 7e Playlist: https://www.youtube.com/playlist?list=PLl-gb0E4MII28GykmtuBXNUNoej-vY5Rz
From playlist Discrete Math I (Entire Course)
This is the first in a series of videos about the merge sort. It describes the principle of the merge sort algorithm, which takes a ‘divide and conquer’ approach to the problem of sorting and unordered list. The videos that follow build on these principles, leading towards a recursive im
From playlist Sorting Algorithms
[Discrete Mathematics] Integer Partitions
We talk about the number of ways to partition an integer. Visit our website: http://bit.ly/1zBPlvm Subscribe on YouTube: http://bit.ly/1vWiRxW *--Playlists--* Discrete Mathematics 1: https://www.youtube.com/playlist?list=PLDDGPdw7e6Ag1EIznZ-m-qXu4XX3A0cIz Discrete Mathematics 2: https://
From playlist Discrete Math 2
M. Zadimoghaddam: Randomized Composable Core-sets for Submodular Maximization
Morteza Zadimoghaddam: Randomized Composable Core-sets for Distributed Submodular and Diversity Maximization An effective technique for solving optimization problems over massive data sets is to partition the data into smaller pieces, solve the problem on each piece and compute a represen
From playlist HIM Lectures 2015
Alina Ene: The Power of Randomization Distributed Submodular Maximization on Massive Datasets
A wide variety of problems in machine learning, including exemplar clustering, document summarization, and sensor placement, can be cast as constrained submodular maximization problems. Unfortunately, the resulting submodular optimization problems are often too large to be solved on a sing
From playlist HIM Lectures 2015
Partitions of a Set | Set Theory
What is a partition of a set? Partitions are very useful in many different areas of mathematics, so it's an important concept to understand. We'll define partitions of sets and give examples in today's lesson! A partition of a set is basically a way of splitting a set completely into disj
From playlist Set Theory
The Lone Divider Method: Why It Doesn't Pay To Be Greedy
This video explains what can happen if a player is greedy or dishonest when applying the lone divider method. Site:http://mathispower4u.com
From playlist Fair Division
Kyle Cranmer: "Quarks, hierarchical clustering, and combinatorial optimization"
Deep Learning and Combinatorial Optimization 2021 "Quarks, hierarchical clustering, and combinatorial optimization" Kyle Cranmer - New York University Abstract: Combinatorial optimization isn’t a topic that is discussed much in experimental particle physics, but it is hiding in one of th
From playlist Deep Learning and Combinatorial Optimization 2021
Yuval Filmus: Monotone Submodular Optimization over a Matroid
We consider the NP-hard problem of maximizing a monotone submodular function over a matroid constraint. Vondrak's continuous greedy algorithm achieves the best possible approximation ratio 1-1/e using continuous methods. Can the same be accomplished combinatorially? We show that this is ar
From playlist HIM Lectures 2015
Seffi Naor: Recent Results on Maximizing Submodular Functions
I will survey recent progress on submodular maximization, both constrained and unconstrained, and for both monotone and non-monotone submodular functions. The lecture was held within the framework of the Hausdorff Trimester Program: Combinatorial Optimization.
From playlist HIM Lectures 2015
MIT 6.172 Performance Engineering of Software Systems, Fall 2018 Instructor: Julian Shun View the complete course: https://ocw.mit.edu/6-172F18 YouTube Playlist: https://www.youtube.com/playlist?list=PLUl4u3cNGP63VIBQVWguXxZZi0566y7Wf Professor Shun discusses races and parallelism, how ci
From playlist MIT 6.172 Performance Engineering of Software Systems, Fall 2018
Frédéric Vivien : Algorithmes d’approximation - Partie 2
Résumé : Dans la deuxième partie de ce cours nous considérerons un problème lié, celui des algorithmes compétitifs. Dans le cadre de l'algorithmique « en-ligne », les caractéristiques d'une instance d'un problème ne sont découvertes qu'au fur et à mesure du traitement de l'instance (comme
From playlist Mathematical Aspects of Computer Science
Nexus Trimester - Michael Kapralov (EPFL)
Approximating matchings in sublinear space Michael Kapralov (EPFL) March 08, 2016 Abstract: Finding maximum matchings in graphs is one of the most well-studied questions in combinatorial optimization. This problem is known to be solvable in polynomial time if the edge set of the graph can
From playlist 2016-T1 - Nexus of Information and Computation Theory - CEB Trimester
Dieter Rautenbach: Restricted types of matchings
Abstract: We present new results concerning restricted types of matchings such as uniquely restricted matchings and acyclic matchings, and we also consider the corresponding edge coloring notions. Our focus lies on bounds, exact and approximative algorithms. Furthermore, we discuss some ma
From playlist Combinatorics
Example of Countable Partition
Real Analysis: We give an example of a partition of the natural numbers N consisting of a countably infinite number of countably infinite subsets. Conversely we note that a countable union of countably infinite sets is countably infinite.
From playlist Real Analysis
Lec 13 | MIT 6.172 Performance Engineering of Software Systems, Fall 2010
Lecture 13: Parallelism and Performance Instructor: Charles Leiserson View the complete course: http://ocw.mit.edu/6-172F10 License: Creative Commons BY-NC-SA More information at http://ocw.mit.edu/terms More courses at http://ocw.mit.edu
From playlist MIT 6.172 Performance Engineering of Software Systems