Coding theory | Application-specific graphs
In coding theory, a Tanner graph, named after Michael Tanner, is a bipartite graph used to state constraints or equations which specify error correcting codes. In coding theory, Tanner graphs are used to construct longer codes from smaller ones. Both encoders and decoders employ these graphs extensively. (Wikipedia).
Platonic graphs and the Petersen graph
In this tutorial I show you to construct the five platonic graphs and the Peterson graph in Mathematica and we use some of the information in the previous lectures to look at some of the properties of these graphs, simply by looking at their graphical representation.
From playlist Introducing graph theory
Graph of x^2 + 6xb + 5b^2 as b varies
From playlist 3d graphs
Local Correctability of Expander Codes - Brett Hemenway
Brett Hemenway University of Pennsylvania April 14, 2014 An error-correcting code is called locally decodable if there exists a decoding algorithm that can recover any symbol of the message with high probability by reading only a small number of symbols of the corrupted codeword. There is
From playlist Mathematics
Lifting small locally testable codes (LTCs) to large LTCs via HDXs - Prahladh Harsha
Computer Science/Discrete Mathematics Seminar I Topic: Lifting small locally testable codes (LTCs) to large LTCs via HDXs Speaker: Prahladh Harsha Affiliation: Tata Institute of Fundamental Research Date: November 25, 2019 For more video please visit http://video.ias.edu
From playlist Mathematics
Lec 18 | MIT 6.451 Principles of Digital Communication II
Codes on Graphs View the complete course: http://ocw.mit.edu/6-451S05 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.451 Principles of Digital Communication II
What We See and What We Value: AI with a Human Perspective
2022 Tanner Lecture on Artificial Intelligence and Human Values, Whitney Humanities Center Fei-Fei Li of Stanford University delivered the 2022 Tanner Lecture on Human Values and Artificial Intelligence this fall at the Whitney Humanities Center. The lecture, “What We See and What We Valu
From playlist Tanner Lectures on Human Values
Lec 19 | MIT 6.451 Principles of Digital Communication II
The Sum-Product Algorithm View the complete course: http://ocw.mit.edu/6-451S05 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.451 Principles of Digital Communication II
What is a Path Graph? | Graph Theory
What is a path graph? We have previously discussed paths as being ways of moving through graphs without repeating vertices or edges, but today we can also talk about paths as being graphs themselves, and that is the topic of today's math lesson! A path graph is a graph whose vertices can
From playlist Graph Theory
Graph of x^2 + y^2 + pxy as p varies
From playlist 3d graphs
From playlist 3d graphs
The Video going to guide how to make quadratic function with graph. lets see the video to make it, it's easy.
From playlist CALCULUS
Graph Theory FAQs: 01. More General Graph Definition
In video 02: Definition of a Graph, we defined a (simple) graph as a set of vertices together with a set of edges where the edges are 2-subsets of the vertex set. Notice that this definition does not allow for multiple edges or loops. In general on this channel, we have been discussing o
From playlist Graph Theory FAQs
Algebra for Kids - The Hockey Pucks Problem
This series of videos is an introduction to Algebra, with 3rd and 4th graders in mind, and all other math enthusiasts! In this video, our friends Dominic and Tanner join us to solve a problem about hockey pucks. The hockey puck image is courtesy of Wikimedia Commons and "MrPanyGoff": http
From playlist Algebra for Kids
Tanner Lectures on Human Values: "The New Global Mobility Regime"
First lecture on "Borders in the Age of Networks." Achille Mbembe is a research professor in history and politics at the Wits Institute for Social and Economic Research (WiSER), University of the Witwatersrand, Johannesburg, South Africa. He holds a PhD in history from the Université de Pa
From playlist Whitney Humanities Center
Tree Graphs - 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
Top Gear: After-hours with Rutledge | History
Rutledge takes Tanner's camaro for an after-hours spin. Top Gear Subscribe for more Top Gear: http://histv.co/SubscribeHistoryYT Check out exclusive Top Gear videos and full episodes: http://www.history.com/shows/top-gear Like the official Top Gear Facebook page: https://www.facebook.co
From playlist Top Gear: Best of Adam Ferrara | History
The formal definition of a sequence.
We have an intuitive picture of sequences (infinite ordered lists). But there is a formal definition of sequences based out of the idea of a specific function between sets, specifically from the positive integers to the real numbers. ►Full DISCRETE MATH Course Playlist: https://www.youtu
From playlist Discrete Math (Full Course: Sets, Logic, Proofs, Probability, Graph Theory, etc)
16. American Film in the 1970s, Part II (2007)
MIT 21L.011 The Film Experience, Fall 2013 View the complete course: http://ocw.mit.edu/21L-011F13 Instructor: David Thorburn Continue the discussion of transformation and subversion in 1970s films, specifically as embodied in the work of director Robert Altman. Detailed preview of McCabe
From playlist MIT 21L.011 The Film Experience, Fall 2013
