Combinatorics | Discrete mathematics
The Center for Discrete Mathematics and Theoretical Computer Science (DIMACS) is a collaboration between Rutgers University, Princeton University, and the research firms AT&T, Bell Labs, Applied Communication Sciences, and NEC. It was founded in 1989 with money from the National Science Foundation. Its offices are located on the Rutgers campus, and 250 members from the six institutions form its permanent members. DIMACS is devoted to both theoretical development and practical applications of discrete mathematics and theoretical computer science. It engages in a wide variety of evangelism including encouraging, inspiring, and facilitating researchers in these subject areas, and sponsoring conferences and workshops. Fundamental research in discrete mathematics has applications in diverse fields including Cryptology, Engineering, Networking, and Management Decision Support. Past directors have included Fred S. Roberts, Daniel Gorenstein, András Hajnal, and Rebecca N. Wright. (Wikipedia).
DesmosLIVE: An Exploration of Desmos + Mathalicious
Kate Nowak of Mathalicious explores a few Mathalicious lessons with Desmos
From playlist Desmos LIVE
What Is a radian? Coffee ☕️ + Desmos 🙂 this AM = https://www.desmos.com/calculator/bcgjcpci3k. Also added to https://teacher.desmos.com/activitybuilder/custom/60742b18afd8ae0d274b6efb.
From playlist Desmos Activities, Illustrations, and How-To's
Polymorphs can be a headache for people who make pharmaceuticals. Find out why? More chemistry at http://www.periodicvideos.com/
From playlist Chem Definition - Periodic Videos
Pseudorandom Generators for Read-Once ACC^0 - Srikanth Srinivasan
Srikanth Srinivasan DIMACS April 24, 2012 We consider the problem of constructing pseudorandom generators for read-once circuits. We give an explicit construction of a pseudorandom generator for the class of read-once constant depth circuits with unbounded fan-in AND, OR, NOT and generaliz
From playlist Mathematics
The SOS (aka Sum-of-Squares) System Series Raghu Meka (1) and Avi Wigderson (2)
Raghu Meka (1) and Avi Wigderson (2) DIMACS (1) and Professor, School of Mathematics, IAS (2) December 18, 2012 We will give an overview of this system, which has been at the center of recent algorithmic and proof complexity developments. We will give the definitions of the system (as a pr
From playlist Mathematics
Association Schemes, Non-Commutative Polynomials and... Lower Bounds for Planted Clique - Raghu Meka
Raghu Meka DIMACS (Rutgers); Member, School of Mathematics May 13, 2013 Finding cliques in random graphs and the closely related "planted" clique variant, where a clique of size k is planted in a random G(n,1/2) graph, have been the focus of substantial study in algorithm design. Despite m
From playlist Mathematics
A Few Words on Digital Dissemination with Lucas Swineford
Lucas Swineford, Director of Yale's Office of Digital Dissemination & Online Education, shares a few words on digital dissemination at Yale University at the Yale Online Education Open Forum.
From playlist Yale Online Education Open Forum
Khalid Lafi's PerfBar Lightning Demo - Velocity Europe 2014
A PerfBar lightning demo from Velocity Europe 2014 in Barcelona, "Always Keep an Eye on Your Website Performance - PerfBar." Watch more from Velocity Europe 2014: http://goo.gl/Hl7fvj Visit the Velocity website to learn more: http://velocityconf.com/velocityeu2014/ Subscribe for more from
From playlist Velocity Europe 2014
Subscribe to our YouTube Channel for all the latest from World Science U. Visit our Website: http://www.worldscienceu.com/ Like us on Facebook: https://www.facebook.com/worldscienceu Follow us on Twitter: https://twitter.com/worldscienceu
From playlist Science Unplugged: General Relativity
From playlist the absolute best of stereolab
Sanjeev Arora: Toward Theoretical Understanding of Deep Learning
Sanjeev Arora presents his talk "Toward Theoretical Understanding of Deep Learning" at the Three Decades of DIMACS Conference held on November 21-22, 2019. For more information, please see http://dimacs.rutgers.edu/events/details?eID=1226.
From playlist ML @ Scale
Twitch Talks - Complex Visualization
Presenter: Brett Champion Wolfram Research developers demonstrate the new features of Version 12 of the Wolfram Language that they were responsible for creating. Previously broadcast live on May 2, 2019 at twitch.tv/wolfram. For more information, visit: https://www.wolfram.com/language/12
From playlist Twitch Talks
From playlist the absolute best of stereolab
Tantric Science - This is Only a Test 413 - 8/24/17
The gang talks about how they watched the recent solar eclipse, Disney's rumored Netflix competitor, The Defenders miniseries, and VR Mario Kart. Plus, more Elon shower thoughts and the scientific answer to a horse-related oddity! Subscribe for more videos! http://www.youtube.com/subscrip
From playlist This Is Only a Test