Events

Filters
Export this event to calendar
iCal
RSS
RSS
Close X

Filter by:

Limit to events where the first date of the event:
Date range
Limit to events where the first date of the event:
Limit to events where the title matches:
Limit to events where the type is one or more of:
Limit to events tagged with one or more of:
Limit to events where the audience is one or more of:
Thursday, May 10, 2018 12:00 pm - 12:00 pm EDT (GMT -04:00)

PhD Seminar • Human-Computer Interaction — Supporting Workplace Detachment and Reattachment with Conversational Intelligence

Please note: This seminar has been cancelled.

Alex C. Williams, PhD candidate
David R. Cheriton School of Computer Science

Friday, May 11, 2018 1:30 pm - 1:30 pm EDT (GMT -04:00)

Seminar • Networks and Distributed Systems RAMP: RDMA Migration Platform

Babar Naveed Memon, Master’s candidate
David R. Cheriton School of Computer Science

Remote Direct Memory Access (RDMA) can be used to implement a shared storage abstraction or a shared nothing abstraction for distributed applications. We argue that the shared storage abstraction is an overkill for loosely coupled applications and that the shared nothing abstraction does not leverage all the benefits of RDMA.

Friday, May 11, 2018 2:00 pm - 2:00 pm EDT (GMT -04:00)

Master’s Thesis Presentation • Artificial Intelligence — Deep Context Resolution

Junnan Chen, Master’s candidate
David R. Cheriton School of Computer Science

Conversations depend on information from the context. To go beyond one-round conversation, a chatbot must resolve contextual information such as: 1) co-reference resolution, 2) ellipsis resolution, and 3) conjunctive relationship resolution.

There are simply not enough data to avoid these problems by trying to train a sequence-to-sequence model for multi-round conversation similar to that of one-round conversation.

Wednesday, May 16, 2018 1:00 pm - 1:00 pm EDT (GMT -04:00)

Master’s Thesis Presentation • Data Systems — Math Information Retrieval using a Text Search Engine

Dallas Fraser, Master’s candidate
David R. Cheriton School of Computer Science

Combining text and mathematics when searching in a corpus with extensive mathematical notation remains an open problem. Recent results for math information retrieval systems on the math and text retrieval task at NTCIR-12, for example, show room for improvement, even though formula retrieval appears to be fairly successful.

Tuesday, May 22, 2018 2:00 pm - 2:00 pm EDT (GMT -04:00)

Seminar • Formal Methods — Everything’s Bigger in Texas: “The Largest Math Proof Ever”

Marijn Heule, Research Assistant Professor
University of Texas at Austin

Progress in satisfiability (SAT) solving has enabled answering long-standing open questions in mathematics completely automatically, resulting in clever though potentially gigantic proofs. We illustrate the success of this approach by presenting the solution of the Boolean Pythagorean triples problem. We also produced and validated a proof of the solution, which has been called the "largest math proof ever."