Toward learned algorithms, data structures, and systems

Tim Kraska outlines ways to build learned algorithms and data structures to achieve “instance optimality” and unprecedented performance for a wide range of applications.

By Tim Kraska
July 8, 2019

This is a keynote highlight from the O’Reilly Artificial Intelligence Conference in Beijing 2019. Watch the full version of this keynote on the O’Reilly online learning platform.

You can also see other highlights from the event.

Learn faster. Dig deeper. See farther.

Join the O'Reilly online learning platform. Get a free trial today and find answers on the fly, or master something new and useful.

Learn more
Post topics: AI & ML
Share:

Get the O’Reilly Artificial Intelligence Newsletter

Get the O’Reilly Artificial Intelligence Newsletter