Current students

Please note: This master’s thesis presentation will take place online.

Kritika Iyer, Master’s candidate
David R. Cheriton School of Computer Science

Supervisor: Professor Ian Goldberg

Please note: This PhD seminar will take place online.

Justin Tracey, PhD candidate
David R. Cheriton School of Computer Science

Supervisor: Professor Ian Goldberg

Please note: This seminar will take place in DC 1304.

Xupeng Miao, Postdoctoral Researcher
Computer Science Department, Carnegie Mellon University

In this talk, I will introduce my work on machine learning (ML) parallelization, a critical endeavor to bridge the significant gap between diverse ML programs and multitiered computing architectures. Specifically, I will explore ML parallelization at three distinct yet interconnected levels.

Please note: This seminar will take place in DC 1304.

Misha Khodak, PhD candidate
Computer Science Department, Carnegie Mellon University

Advances in machine learning (ML) have led to skyrocketing demand across diverse applications beyond vision and text, resulting in unique theoretical and practical challenges. The vastness of use cases calls for general-purpose yet customizable tools for tackling large subclasses of such problems.

Thursday, April 4, 2024 4:30 pm - 6:30 pm EDT (GMT -04:00)

CS 383 Computational Art Exhibition

CS/FINE 383 is a third-year studio course where students work in an interdisciplinary environment to combine computer science principles with fine art technical and conceptual skills. Experience novel computational art works and aesthetic experiences using generative agents, advanced computer vision, distributed computing, and more.

Where is the Computational Art Exhibition?

Please note: This seminar will take place in DC 3317 and online.

Mahsa Derakhshan, Assistant Professor
Khoury College of Computer Sciences, Northeastern University

In this talk, we discuss the stochastic vertex cover problem. In this problem, G is an arbitrary known graph, and G* is an unknown random subgraph of G containing each of its edges independently with a known probability p. Edges of G* can only be verified using edge queries. The goal in this problem is to find a minimum vertex cover of G* using a small number of queries.

Professor Daniel Vogel at the Cheriton School of Computer Science, Professor Géry Casiez at France’s University of Lille, and researchers Mathieu Nancel and Sylvain Malacria at the Inria centre at the University of Lille, have been funded to create an Associate Team at Inria — France’s National Institute for Research in Digital Science and Technology.