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:
Monday, November 28, 2022 2:00 pm - 3:00 pm EST (GMT -05:00)

PhD Seminar • Human-Computer Interaction • Conductor: Intersection-Based Bimanual Pointing in AR and VR

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

Futian (Caesar) Zhang, PhD candidate
David R. Cheriton School of Computer Science

Supervisors: Professors Jian Zhao, Keiko Katsuragawa

Pointing is an elementary interaction in virtual and augmented reality environments, and, to effectively support selection, techniques must deal with the challenges of occlusion and depth specification. Most of the previous techniques require two explicit steps to handle occlusion.

Tuesday, November 29, 2022 4:00 pm - 5:00 pm EST (GMT -05:00)

Seminar • Systems and Networking • Ledgers, Machines, and Markets

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

Yaron Minsky, Jane Street

The rise of blockchain has led to a renewed interest in the use of ledgers as a basic data-structure for building distributed systems.

But the use of ledgers to build distributed systems is a very old idea, playing an important role in both academic computer science (in the guise of state machine replication) and in real-world financial technology.

Friday, December 2, 2022 2:00 pm - 3:00 pm EST (GMT -05:00)

PhD Seminar • Algorithms and Complexity • Shortest Beer Path Queries in Interval Graphs

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

Kevin Wu, PhD candidate
David R. Cheriton School of Computer Science

Supervisor: Professor Ian Munro

Our interest is in paths between pairs of vertices that go through at least one of a subset of the vertices known as beer vertices. Such a path is called a beer path, and the beer distance between two vertices is the length of the shortest beer path.