Journal of Symbolic Computation

George Labahn 3/10/16 Part 2

Title: Symbolic-Numeric Computation with Rational Functions Symbolic-Numeric Computing Seminar

From playlist Symbolic-Numeric Computing Seminar

Hoon Hong 11/17/16 Part 3

Title: Root Separation Bound

From playlist Symbolic-Numeric Computing Seminar

Shadows of Computation - Lecture 5 - What is Computation?

Welcome to Shadows of Computation, an online course taught by Will Troiani and Billy Snikkers, covering the foundations of category theory and how it is used by computer scientists to abstract computing systems to reveal their intrinsic mathematical properties. In the fifth lecture Will sp

From playlist Shadows of Computation

Dan Bates 3/17/16

Title: Numerical methods for investigating parameter spaces for parameterized polynomial systems Symbolic-Numeric Computing Seminar

From playlist Symbolic-Numeric Computing Seminar

The mother of all representer theorems for inverse problems & machine learning - Michael Unser

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

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

Mioara Joldes: Validated symbolic-numerci algorithms and practical applications in aerospace

In various fields, ranging from aerospace engineering or robotics to computer-assisted mathematical proofs, fast and precise computations are essential. Validated (sometimes called rigorous as well) computing is a relatively recent field, developed in the last 20 years, which uses numerica

From playlist Probability and Statistics

The Reporter's Notebook - Mark Hansen (Columbia Journalism School)

Beyond Twitter, Facebook, and similar networks, without question, data, code, and algorithms are forming systems of power in our society. Mark Hansen explains why it is crucial that journalists—explainers of last resort—be able to interrogate these systems, holding power to account. Hanse

From playlist JupyterCon in New York 2018

Stanford Lecture: Mathematical Writing - Refereeing (2)

The class notes are available as a Stanford report, Mathematical Writing (http://www-cs-faculty.stanford.edu/~knuth/papers/cs1193.pdf), and a published book (http://www-cs-faculty.stanford.edu/~knuth/klr.html). November 2, 1987 Professor Knuth is the Professor Emeritus at Stanford Univer

From playlist Donald Knuth Lectures

George Labahn 3/10/16 Part 1

Symbolic-Numeric Computation with Rational Functions Symbolic-Numeric Computing Seminar

From playlist Symbolic-Numeric Computing Seminar

Beauty in the Messiness (with Philip Moriarty) - Numberphile Podcast

Experimental physicist Phil Moriarty works with temperamental microscopes and individual atoms. Today's topics include Ireland, mathematics, failing at university, microscopy, academic gripes... and music. Professor Moriarty's university page - including links to some of his papers - http

From playlist The Numberphile Podcast

On the (unreasonable) effectiveness of compressive imaging – Ben Adcock, Simon Fraser University

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

Seminar on Applied Geometry and Algebra (SIAM SAGA): Bernd Sturmfels

Date: Tuesday, February 9 at 11:00am EST (5:00pm CET) Speaker: Bernd Sturmfels, MPI MiS Leipzig / UC Berkeley Title: Linear Spaces of Symmetric Matrices. Abstract: Real symmetric matrices appear ubiquitously across the mathematical sciences, and so do linear spaces of such matrices. We

From playlist Seminar on Applied Geometry and Algebra (SIAM SAGA)

1960 General Electric Computer - GE 210 - 1961 MICR - Banking Finance Data Processing

From US Government Archives, a 1961 film spotlights the GE 210 Computer. The GE 210 Computer announced in 1960 was based on the earlier ERMA (Electronic Recording Machine Accounting) system developed in the early 1950’s. ERMA systems used MICR (magnetic ink Character recognition) which

From playlist Computers of the 1960's

Where can (and should) you publish your natural language processing research? (w/ Philip Resnik)

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://sites.google.com/umd.edu/2021cl1webpage/ (Including homeworks and reading.) Resources: List of NLP Venues https://medium.c

From playlist Computational Linguistics I

R - Markdown with Papaja 3

Lecturer: Dr. Erin M. Buchanan Missouri State University Fall 2017 Learn how to use R markdown to write APA style manuscripts with the handy papaja github package. Part 3 of the larger series on how to write completely reproducible manuscripts. In this video we cover citation styles and

From playlist Learn R + Statistics

Marcelo Frias: Relational tight field bounds for distributed analysis of programs

HYBRID EVENT Recorded during the meeting "19th International Conference on Relational and Algebraic Methods in Computer Science" the November 3, 2021 by the Centre International de Rencontres Mathématiques (Marseille, France) Filmmaker: Guillaume Hennenfent Find this video and other t

From playlist Virtual Conference

Lecture 12: End-to-End Models for Speech Processing

Lecture 12 looks at traditional speech recognition systems and motivation for end-to-end models. Also covered are Connectionist Temporal Classification (CTC) and Listen Attend and Spell (LAS), a sequence-to-sequence based model for speech recognition. -------------------------------------

From playlist Lecture Collection | Natural Language Processing with Deep Learning (Winter 2017)

The Curtis-Hedlund-Lyndon Theorem | Nathan Dalaklis | math academic talks

This is the second seminar talk that I have given as a math phd student. It is an expository academic talk that I gave as a Math PhD student during my second semester of my second year in my PhD program. The talk concerns the Factors of Symbolic Dynamical Systems and is focused on the Curt

From playlist Academic Talks

Jonathan Hauenstein 2/4/16

Title: Computing real solutions to systems of polynomial equations using numerical algebraic geometry Symbolic-Numeric Computing Seminar

From playlist Symbolic-Numeric Computing Seminar