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

Displayed time zone: Amsterdam, Berlin, Bern, Rome, Stockholm, Vienna change

13:40 - 15:20
Incremental computing 2: Research talksIC at Vertex WS215
13:40
30m
Talk
Automated Incrementalization through Synthesis
IC
Rohin Shah University of California, Berkeley, Rastislav Bodík University of Washington
File Attached
14:15
30m
Talk
IceDust Calculation Strategy Composition Performance in Web Applications
IC
Daco Harkes Delft University of Technology, Eelco Visser Delft University of Technology
File Attached
14:50
30m
Talk
Automatic Incrementalization of Functional Reports
IC
Ken Friis Larsen DIKU, University of Copenhagen, Fritz Henglein DIKU, Denmark
File Attached