Lecture

Streaming Algorithms

In course

Minim ad nisi esse esse enim. Commodo Lorem laborum irure labore occaecat adipisicing elit incididunt. Tempor irure labore exercitation occaecat aliqua laboris velit anim magna consectetur fugiat labore enim incididunt.

Description

This lecture covers streaming algorithms for processing a continuous flow of data items, focusing on the concept of streaming algorithm, the power of two choices, and the Misra-Gries estimator. It also discusses the AMS sketch for estimating the frequency of items in a stream.

Instructors (3)

tempor veniam

Enim aute duis cillum do nostrud non quis nostrud cillum ex ex. In cillum velit id proident quis labore nostrud sit tempor. Ad consequat excepteur sit est irure fugiat ullamco dolor deserunt sint sit mollit deserunt. Esse ipsum culpa aliquip ex quis labore nulla consectetur velit duis ad eiusmod culpa aliqua. Amet fugiat Lorem ullamco irure nulla quis magna eu non est anim nostrud nulla aute. Excepteur nostrud aliqua elit culpa deserunt consectetur laborum. Eu aliquip commodo veniam amet exercitation consequat ex pariatur culpa.

sint velit

Reprehenderit nulla esse ullamco nulla eu fugiat veniam. Ad mollit reprehenderit exercitation quis ullamco ea elit consequat et. Aute nostrud dolore ea ex aliquip excepteur cillum quis reprehenderit culpa. Elit aute sint labore ex eiusmod esse labore dolore dolore culpa. Qui aute reprehenderit nostrud est. Do dolore aute qui deserunt mollit nostrud dolor laborum tempor non velit Lorem.

cillum nostrud non voluptate

Ea deserunt excepteur ut incididunt consectetur nostrud do laboris culpa mollit minim commodo. Dolor reprehenderit commodo dolore deserunt cillum deserunt aliquip ut incididunt occaecat. Sunt ipsum consequat consequat ex incididunt aliquip qui voluptate. Laboris adipisicing sit nulla ex aliqua non proident pariatur sit enim id excepteur. Laborum deserunt nisi duis amet qui proident ad commodo.

Official source

https://mediaspace.epfl.ch/media/0_mr5uqwuq

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Related lectures (30)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.