The SIAM CSE conference seeks to enable in-depth technical discussions on a wide variety of major computational efforts on large-scale problems in science and engineering, foster the interdisciplinary culture required to meet these large-scale challenges, and promote the training of the ne
From playlist SIAM Conference Videos
2012 SIAM Annual Meeting Overview
At the 2012 SIAM Annual Meeting held in July, over a thousand mathematicians and computational scientists gathered from all over the world in Minneapolis, Minnesota, to discuss the state of the art in a variety of disciplines in the mathematical sciences through invited presentation, prize
From playlist SIAM Conference Videos
11b Machine Learning: Computational Complexity
Short lecture on the concept of computational complexity.
From playlist Machine Learning
Panel Discussion on Teaching Computational Social Science
This event held on June 22, 2020 was part of the 2020 SICSS Festival. Speakers: Matti Nelimarkka (SICSS-Princeton 17, SICSS-Helsinki 18, SICSS-Istanbul 19, 20), Rochelle Terman (SICSS-Princeton 17), and Jae Yeon Kim (SICSS-Princeton 19, SICSS-Bay Area 20) Moderator: Matthew Salganik (SIC
From playlist All Videos
AN16 took place July 11-15 in Boston, MA, in parallel with our Life Sciences meeting (LS16) and the Workshop on Network Science (NS16). Check out this short sizzle video to get a glimpse of what went on, plus hashtags #SIAMAN16 and #SIAMLS16 to catch up on conference quotes, photos and con
From playlist SIAM Conference Videos
5. Library Complexity and Short Read Alignment (Mapping)
MIT 7.91J Foundations of Computational and Systems Biology, Spring 2014 View the complete course: http://ocw.mit.edu/7-91JS14 Instructor: David Gifford Prof. Gifford talks about library complexity as it relates to genome sequencing. He explains how to create a full-text minute-size (FM) i
From playlist MIT 7.91J Foundations of Computational and Systems Biology
Experiencing a SIAM Conference: Why Should You Attend?
SIAM conferences are a place to learn about timely topics in applied and computational mathematics and applications and be a part of a group of members exchanging ideas and expanding their networks of colleagues in both academia and industry. Have you been? Hear from the folks in this vide
From playlist SIAM Conference Videos
Arithmetic Complexity of S_{n,k}^* and Multilinear Monomial Counting by Abhranil Chatterjee
Discussion Meeting Workshop on Algebraic Complexity Theory  ORGANIZERS Prahladh Harsha, Ramprasad Saptharishi and Srikanth Srinivasan DATE & TIME 25 March 2019 to 29 March 2019 VENUE Madhava Lecture Hall, ICTS Bangalore Algebraic complexity aims at understanding the computationa
From playlist Workshop on Algebraic Complexity Theory 2019
Full Stack Development in the Era of Serverless Computing
Building your own real-world, secure & scalable GraphQL API is a lot of work. With AppSync, robust GraphQL APIs including schema, resolvers, and data sources are created & configured automatically and instantly through either the AWS Amplify CLI or the AppSync console, abstracting away muc
From playlist Serverless
Tony Bahri, Research talk - 10 February 2015
Tony Bahri (Rider University) - Research talk http://www.crm.sns.it/course/4350/ I shall describe geometric and algebraic approaches to the computation of the cohomology of polyhedral products arising from homotopy theory. A report on joint work with Martin Bendersky, Fred Cohen and Sam G
From playlist Algebraic topology, geometric and combinatorial group theory - 2015
Just machine learning In this talk, I will address some concerns about the use of machine learning in situations where the stakes are high (such as criminal justice, law enforcement, employment decisions, credit scoring, health care, public eligibility assessment, and school assignments).
From playlist DSI Virtual Seminar Series
LA Rubyconf 2015- Build to Last... by Mike Moore
Build to Last: How to design rails apps to avoid a rewrite in 5 years
From playlist LA Rubyconf 2015
Alexander RAHM - Verification of the Quillen conjecture in the rank 2 imaginary quadratic case
We confirm a conjecture of Quillen in the case of the mod 2 cohomology of arithmetic groups SL(2, A[1/2]), where A is an imaginary quadratic ring of integers. To make explicit the free module structure on the cohomology ring conjectured by Quillen, we compute the mod 2 cohomology of SL(2,
From playlist École d'Été 2022 - Cohomology Geometry and Explicit Number Theory
Many of us strive for perfection in software development, is this really an appropriate target to aim for? Perfect code is an illusion. Software engineering is an empirical discipline, and the software we create is only ever correct in a narrow context, from a technical and a social perspe
From playlist Software Engineering
The Computer Chronicles - Careers in Computing (1986)
Special thanks to archive.org for hosting these episodes. Downloads of all these episodes and more can be found at: http://archive.org/details/computerchronicles
From playlist The Computer Chronicles 1986 Episodes
Lenore Blum - Alan Turing and the other theory of computing and can a machine be conscious?
Abstract Most logicians and theoretical computer scientists are familiar with Alan Turing’s 1936 seminal paper setting the stage for the foundational (discrete) theory of computation. Most however remain unaware of Turing’s 1948 seminal paper which introduces the notion of condition, sett
From playlist Turing Lectures
In this presentation from the Wolfram Technology Conference, Gerald Thomas explores some applications of decision process theory, which uses differential geometry techniques to predict future decisions. For more information about Mathematica, please visit: http://www.wolfram.com/mathemat
From playlist Wolfram Technology Conference 2012
The Computational Complexity of Geometric Topology Problems - Greg Kuperberg
Greg Kuperberg University of California, Davis September 24, 2012 This talk will be a partial survey of the first questions in the complexity theory of geometric topology problems. What is the complexity, or what are known complexity bounds, for distinguishing n-manifolds for various n? Fo
From playlist Mathematics
Ruby on Ales 2014 - Ruby as Science, Art & Craft
By Davy Stevenson Developers are encouraged, and sometimes required, to study Computer Science, however a large percentage of us are self-taught or have entered programming through related fields. This sits in stark contrast to most other engineering disciplines, and this diversity is pos
From playlist Ruby on Ales 2014