Max-Planck-Institut für Informatik
max planck institut
informatik
mpii logo Minerva of the Max Planck Society
 

MPI-INF or MPI-SWS or Local Campus Event Calendar

<< Previous Entry Next Entry >> New Event Entry Edit this Entry Login to DB (to update, delete)
What and Who
Title:Online Sampling with Minimal Randomness
Speaker:Davis Issac
coming from:Max-Planck-Institut für Informatik - D1
Speakers Bio:
Event Type:AG1 Mittagsseminar (own work)
Visibility:D1
We use this to send out email in the morning.
Level:AG Audience
Language:English
Date, Time and Location
Date:Tuesday, 25 August 2015
Time:13:00
Duration:30 Minutes
Location:Saarbrücken
Building:E1 4
Room:024
Abstract
We study the amount of randomness required to sample an item from a stream of items. The items keep on arriving and we need to store a single element from the items seen so far. The sampled element at any point of time should be an uniform sample of the elements seen so far. We give an algorithm which does this using $O(\log n)$ random bits. This matches the offline lower bound for the problem. Our algorithm is also space and time efficient.
Contact
Name(s):Davis Issac
EMail:dissac@mpi-inf.mpg.de
Video Broadcast
Video Broadcast:NoTo Location:
Tags, Category, Keywords and additional notes
Keywords:discrete sampling; streaming algorithms
Note:
Attachments, File(s):
Created by:Davis Issac, 08/10/2015 03:22 PMLast modified by:Uwe Brahm/MPII/DE, 11/24/2016 04:13 PM
  • Davis Issac, 08/10/2015 03:23 PM
  • Davis Issac, 08/10/2015 03:22 PM -- Created document.