Upcoming Events

CS Colloquium - "Learning Sparse Dependence Structure in Complex-Valued Tensor Data" promotional image

CS Colloquium - "Learning Sparse Dependence Structure in Complex-Valued Tensor Data"

Friday, September 18, 2026 3:30pm to 4:30pm
Schaeffer Hall
Complex-valued tensor data arise in signal processing and neuroscience. Learn more about the method using local field potential recordings, where sparse separable factor analysis (SSFA) captures dependence across brain region, frequency, and time and supports reconstruction of missing signals
CS Colloquium - "Approximation Algorithms: Some ancient, some new - the good, the bad and the ugly" promotional image

CS Colloquium - "Approximation Algorithms: Some ancient, some new - the good, the bad and the ugly"

Friday, September 25, 2026 3:30pm to 4:30pm
Schaeffer Hall
Northwestern University's Peter and Adrienne Barris Chair of Computer Science will speak on the use of greedy algorithms for a basic graph problem called connected dominating set, and the development of LP based algorithms for a basic scheduling problem in the context of data center scheduling.

Past Events

GAUSS Seminar: Puzzles, Ice, & Grothendieck Polynomials promotional image

GAUSS Seminar: Puzzles, Ice, & Grothendieck Polynomials

Tuesday, September 21, 2021 3:30pm to 4:20pm
Schaeffer Hall
Abstract

From a summer REU at the University of Minnesota, we constructed a solvable lattice model for the dual weak symmetric Grothendieck polynomials in hopes of using such a model to prove related properties of these polynomials, including Cauchy identities and branching rules. We also considered a similar lattice model construction for the weak symmetric Grothendieck polynomials in hopes of proving a Cauchy identity, concluding with a negative result. Moreover, we expand on previous work by...

GAUSS Seminar: Rotation Symmetric Boolean Functions and its Matrix promotional image

GAUSS Seminar: Rotation Symmetric Boolean Functions and its Matrix

Tuesday, September 14, 2021 3:30pm to 4:20pm
Schaeffer Hall
Abstract

Digital signatures are an important feature in any encryption/decryption scheme, as it provides a message with integrity, authenticity, and nonrepudiation. The problem occurs when long messages are being exchanged and signatures that are just as long need to be verified. By using hash functions, a ”fingerprint” of the message can be used instead of the message itself for verification, making the process computationally inexpensive. If we consider a single iteration of a general hashing...

Colloquium - Diderot: A Parallel Domain-Specific Language for Image Analysis and Visualization promotional image

Colloquium - Diderot: A Parallel Domain-Specific Language for Image Analysis and Visualization

Friday, September 10, 2021 4:00pm to 5:00pm
MacLean Hall
Speaker

John Reppy

Abstract

The analysis of structure in three-dimensional images is increasingly valuable for biomedical research and computational science.  At the same time, the computational burden of processing images is increasing as devices produce images of higher resolution (e.g., typical CT scans have gone from 128^3 to roughly 512^3 resolutions).  With the latest scanning technologies, it is also more common for the values measured at each sample to be multi-dimensional rather than...

GAUSS Seminar: Mathematics and Redistricting promotional image

GAUSS Seminar: Mathematics and Redistricting

Tuesday, September 7, 2021 3:30pm to 4:20pm
Schaeffer Hall
What we know, what we don't, and where we're going

Every ten years, the Census Bureau conducts the Census, a nation-wide tallying of every single individual living in the United States. In addition to helping governments and researchers manage land, understand population trends, and distribute resources, the Census is essential to a key democratic function: drawing electoral districts. The process of drawing electoral districts, called “redistricting,” divides every state in the United States...

AMCS Seminar

Friday, April 30, 2021 3:30pm to 4:30pm
MacLean Hall

Speaker: Ariel Aloe, Dept. of Psychological and Quantitative Foundations

Topic: Evidence synthesis and meta-analysis

AMCS Seminar

Friday, April 23, 2021 3:30pm to 4:20pm
MacLean Hall

Speaker: Yannick Meurice, Dept. of Physics & Astronomy

Topic: Finding the boundary of quantum advantage for quantum field theory

AMCS Seminar

Friday, April 16, 2021 3:30pm to 4:20pm
MacLean Hall

Speaker: Jia Lu, Department of Mechanical and Industrial Engineering

Topic: What machine learning can tell us about tissue rapture

AMCS Seminar

Friday, April 9, 2021 3:30pm to 4:20pm
MacLean Hall

Speaker: Vincent Rodgers

Topic: Gauged Projective Geometry in Gravitation

AMCS Seminar

Friday, April 2, 2021 3:30pm to 4:20pm
MacLean Hall

Speaker: Shaoping Xiao, Department of Mechanical Engineering

Topic: Motion Planning in Robotics by Using Reinforcement Learning with LTL Constraints

Abstract: High-level robotics motion planning requires the robot to accomplish complex tasks instead of simple go-to-goal navigations. This seminar presents a research topic of motion planning in robotics via the integration of reinforcement learning (RL) and linear temporal logics (LTL). The framework consists of a Markov decision process (MDP)...

AMCS Seminar

Friday, March 26, 2021 3:30pm to 4:20pm
Virtual

Speaker: David Stewart

Topic: TBA