معلومات عن هذه الحلقة
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!
الإنجليزية
الولايات المتحدة
النص 🔗
Are you the producer of this podcast?
Add a podcast transcript
Need Audio-to-Text?
Transcribe with Listen411 in Just 60 Seconds
البحث في الحلقات الماضية
البحث في الحلقات السابقة من Boston Computation Club.
حلقات أخرى في هذا البودكاست
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.
Daniel Melcer is a PhD student at Northeastern University, where he researches formal methods, reinforcement learning, and large language models, among other things. Daniel also has the most colorful hair in the business (bright red for this talk, other colors for other occasions). Today he joined …
Pascal Kesseli is a software engineer and technical lead at Microsoft AI, with a PhD in Computer Science from Oxford (or a DPhil? Or whatever they call PhDs on that side of the pond). Today Pascal joined us to discuss work he completed while at META FAIR, focused on the conjoining of large language…
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…
إخلاء المسؤولية: البودكاست والأعمال الفنية المضمنة في هذه الصفحة مأخوذة من Max von Hippel، وهي مملوكة لمالكها وليست تابعة لشركة Listen Notes, Inc أو معتمدة منها.
تعديل
شكراً على مساعدتنا في الحفاظ على قاعدة بيانات البودكاست مُحدَّثة.
