Write a Blog >>
Thu 22 Jun 2017 13:40 - 14:10 at Vertex WS215 - Incremental computing 2: Research talks

Many domains require fast, efficient incremental algorithms with no runtime overhead, such as in approximate inference algorithms for machine learning. Currently, such algorithms must be produced manually. We propose the use of program synthesis to automate this work, since it is easily extensible, the generated programs are fast, and there is no runtime overhead. We explain the algorithm on a simple example and provide a comparison of synthesis to other techniques that automate incrementalization.

Thu 22 Jun
Times are displayed in time zone: Amsterdam, Berlin, Bern, Rome, Stockholm, Vienna change

13:40 - 15:20: Incremental computing 2: Research talksIC at Vertex WS215
13:40 - 14:10
Talk
IC
Rohin ShahUniversity of California, Berkeley, Rastislav BodikUniversity of Washington
File Attached
14:15 - 14:45
Talk
IC
Daco HarkesDelft University of Technology, Eelco VisserDelft University of Technology
File Attached
14:50 - 15:20
Talk
IC
Ken Friis LarsenDIKU, University of Copenhagen, Fritz HengleinDIKU, Denmark
File Attached