O TYM ODCINKU
Today Xiao Mao joined us to discuss his groundbreaking work, Breaking the Sorting Barrier for Directed Single-Source Shortest Paths. It's not every day you beat Djikstra at something. This was a good one. Thank you for talking to us, Xiao!
Język angielski
Stany Zjednoczone
TRANSKRYPCJA 🔗
Are you the producer of this podcast?
Add a podcast transcript
Need Audio-to-Text?
Transcribe with Listen411 in Just 60 Seconds
WYSZUKAJ MINIONE ODCINKI
Wyszukaj minione odcinki Boston Computation Club.
INNE ODCINKI W TYM PODCASCIE
David A. Noever and Forrest McKee are researchers at PeopleTec, where they work on problems at the intersection of security, defense, and AI/ML. Today David joined us to present their joint work Infecting Generative AI with Viruses. This was a really great presentation that took a rigorous approa…
Max von Hippel is ... me, the organizer and founder of the Boston Computation Club. Today I hosted an extremely informal event to chat about some of the early experiments in FMxAI I was involved with at Galois, two years ago.
Mingwei Zhenga Ph.D. candidate in the Department of Computer Science at Purdue University, advised by Prof. Xiangyu Zhang since 2021. Before that, she received her Bachelor’s degree in Computer Science and Technology from Huazhong University of Science and Technology in 2020. Mingwei's research lie…
Chenfeng Wei is a PhD student at the University of Manchester, where he researches formal guarantees for large language models. Today he joined us to talk about his latest work exploring bugs in smart-contracts. This is a really interesting project at the intersection of explainable AI, smart contr…
Zastrzeżenie: Podcast i grafika osadzone na tej stronie pochodzą z Max von Hippel, który jest własnością jego właściciela i nie jest powiązany ani wspierany przez Listen Notes, Inc.
EDYTUJ
Dziękujemy za pomoc w aktualizowaniu podcastowej bazy danych.
