Campus Event Calendar
Event Entry
What and Who
Reading Articles Online (Master thesis)
Elizaveta Kovalevskaya
Max-Planck-Institut für Informatik - D1
AG1 Mittagsseminar (own work)
AG 1
AG Audience
English
Note: We use this to send email in the morning.
Date, Time and Location
Tuesday, 28 January 2020
13:00
30 Minutes
E1 4
024
Saarbrücken
Abstract
We consider the problem of reading articles while maximizing the information gain within a restricted amount of time.
In each time step, the reader has to decide whether to read the next portion of the current article or to skip the rest irrevocably. Reading papers is not only an important task for researchers, but it also describes the process of learning news through articles in everyday life. In this work we show that the problem admits constant-competitive algorithms under certain, reasonable conditions.
Supervisor: Andreas Karrenbauer
Contact
Sándor Kisfaludi-Bak
--email hidden
passcode not visible
logged in users only
Sándor Kisfaludi-Bak, 01/21/2020 16:12
Sándor Kisfaludi-Bak, 01/21/2020 15:08 -- Created document.
Sándor Kisfaludi-Bak, 01/21/2020 15:08 -- Created document.