11b Machine Learning: Computational Complexity
Short lecture on the concept of computational complexity.
From playlist Machine Learning
Algorithms Explained: Computational Complexity
An overview of computational complexity including the basics of big O notation and common time complexities with examples of each. Understanding computational complexity is vital to understanding algorithms and why certain constructions or implementations are better than others. Even if y
From playlist Algorithms Explained
Lower Bound on Complexity - 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
A Theory of Cryptographic Complexity - Manoj M. Prabhakaran
Manoj M. Prabhakaran University of Illinois at Urbana-Champaign March 1, 2010 In this talk, I shall describe an ongoing project to develop a complexity theory for cryptographic (multi-party computations. Different kinds of cryptographic computations involve different constraints on how in
From playlist Mathematics
How Computers Solve a Crossword [Lecture]
This is a single lecture from a course. If you you like the material and want more context (e.g., the lectures that came before), check out the whole course: https://boydgraber.org/teaching/CMSC_848/ (Including homeworks and reading.) How to Create a Crossword Puzzle: https://www.youtube
From playlist Computational Linguistics I
SketchySVD - Joel Tropp, California Institute of Technology
This workshop - organised under the auspices of the Isaac Newton Institute on “Approximation, sampling and compression in data science” — brings together leading researchers in the general fields of mathematics, statistics, computer science and engineering. About the event The workshop ai
From playlist Mathematics of data: Structured representations for sensing, approximation and learning
The chaotic complexity of natural numbers | Data structures in Mathematics Math Foundations 175
This is a sobering and perhaps disorienting introduction to the fact that arithmetic with bigger numbers starts to look quite different from the familiar arithmetic that we do with the small numbers we are used to. The notion of complexity is key in our treatment of this. We talk about bot
From playlist Math Foundations
Stanford Seminar - New Horizons for Electronic Systems
EE380: Computer Systems Colloquium Seminar New horizons for electronic systems: Devices, design methods and application areas Speaker: Giovanni De Micheli, EPFL (Laussane) Three new game changers enable the design of emerging electronic systems: the use of new devices and materials, the
From playlist Stanford EE380-Colloquium on Computer Systems - Seminar Series
Stanford Seminar: Neuromorphic Chips: Addressing the Nanostransistor Challenge
EE380: Computer Systems Colloquium Seminar Neuromorphic Chips: Addressing the Nanostransistor Challenge by Combining Analog Computation with Digital Communication Speaker: Kwabena Boahen, Stanford University As transistors shrink to nanoscale dimensions, trapped electrons--blocking "lanes
From playlist Stanford EE380-Colloquium on Computer Systems - Seminar Series
Stanford Seminar - An Alternative to the American way of Innovation
EE380: Computer Systems Colloquium Seminar Shenzhen: An Alternative to the American way of Innovation Speaker: Andrew "Bunnie" Huang, Bunniestudios (Singapore) In this talk, we start with a top-down exploration of the electronics ecosystem of Shenzhen. We then pivot at the topic of recyc
From playlist Stanford EE380-Colloquium on Computer Systems - Seminar Series
May 21, 2008 lecture by Dr. Charles Tahan for the Stanford University Computer Systems Colloquium (EE380). In this lecture, Dr. Charles Tahan gives a non-physics perspective on quantum information science and technology, both via some of his own scientific work, but mostly from the vant
From playlist Lecture Collection | Computer Systems Laboratory Colloquium (2007-2008)
[Lecture] What I'm Teaching this Spring: A Seminar on Question Answering
This is a single lecture from a course. If you you like the material and want more context (e.g., the lectures that came before), check out the whole course: http://users.umiacs.umd.edu/~jbg/teaching/CMSC_848/ (Including homeworks and reading.) Music: https://soundcloud.com/alvin-grissom
From playlist Computational Linguistics I
Mission Impossible: Constructing Charles Babbage's Analytical Engine (d)
The Neukom Institute at Dartmouth presents: Mission Impossible: Constructing Charles Babbage's Analytical Engine Given by Doron Swade on May 8th at Dartmouth College Computing is widely viewed as a phenomenon of the electronic age. The mechanical prehistory of computing tends to be seen a
From playlist AnalyticalEngine
Stanford Seminar - Generalized Reversible Computing and the Unconventional Computing Landscape
EE380: Computer Systems Colloquium Seminar Generalized Reversible Computing and the Unconventional Computing Landscape Speaker: Michael P. Frank, Sandia National Laboratories With the end of transistor scaling now in sight, the raw energy efficiency (and thus, practical performance) of c
From playlist Stanford EE380-Colloquium on Computer Systems - Seminar Series
How do we discover MAJORANA PARTICLES in NANOWIRES?
Majorana particles are real solutions of the Dirac equation, representing their own antiparticles. In the condensed matter context, Majorana refers to electronic modes in nanostructures described by peculiar ‘pulled-apart’ wavefunctions and by hypothesized non-Abelian exchange. This last
From playlist Sergey Frolov's talks
October 3, 2007 lecture by Bill Thies for the Stanford University Computer Systems Colloquium (EE 380). Bill Thies provides an overview of microfluidic technologies from a computer science perspective, highlight areas in the which computer science researchers can contribute to this field;
From playlist Lecture Collection | Computer Systems Laboratory Colloquium (2007-2008)
Depth complexity and communication games - Or Meir
Or Meir Institute for Advanced Study; Member, School of Mathematics September 30, 2013 For more videos, visit http://video.ias.edu
From playlist Mathematics
Stanford Seminar - Big Data is (at least) Four Different Problems
"Big Data is (at least) Four Different Problems" - Mike Stonebraker of MIT Support for the Stanford Colloquium on Computer Systems Seminar Series provided by the Stanford Computer Forum. Speaker Abstract and Bio can be found here: http://ee380.stanford.edu/Abstracts/160601.html Colloqu
From playlist Engineering
Optimal transport for machine learning - Gabriel Peyre, Ecole Normale Superieure
This workshop - organised under the auspices of the Isaac Newton Institute on “Approximation, sampling and compression in data science” — brings together leading researchers in the general fields of mathematics, statistics, computer science and engineering. About the event The workshop ai
From playlist Mathematics of data: Structured representations for sensing, approximation and learning
The physics of virus self-assembly by Vinothan N. Manoharan
COLLOQUIUM : THE PHYSICS OF VIRUS SELF-ASSEMBLY SPEAKER : Vinothan N. Manoharan (Harvard University, US) DATE : 05 April 2021 VENUE : Online Colloquium ABSTRACT Simple viruses consist of RNA and proteins that form a shell (called a capsid) that protects the RNA. The capsid is highly
From playlist ICTS Colloquia