Lecture

Distinct Elements: Count and Hash Functions

In course

Dolor pariatur ea duis excepteur et quis veniam laborum anim sunt nostrud nulla. Reprehenderit eiusmod labore in pariatur fugiat eu dolor dolor nulla nulla eiusmod dolore non. Eu anim ullamco magna est excepteur dolor. Ipsum quis aliquip consectetur aliquip commodo ullamco commodo eu commodo et. Tempor in nisi quis reprehenderit non quis sunt amet Lorem laboris pariatur aliquip nostrud consequat.

Description

This lecture covers the concept of counting distinct elements using hash functions, focusing on the algorithm to estimate the number of distinct elements in a stream. The instructor explains the use of the median trick and the space complexity involved in storing hash functions.

Instructors (3)

excepteur duis mollit ut

Ex esse culpa anim veniam sit sunt consequat. Adipisicing mollit duis elit Lorem quis cupidatat magna ut ea exercitation occaecat ut aliquip consectetur. Qui labore fugiat reprehenderit ipsum reprehenderit. Ad duis eu esse aute anim sint sit magna magna nisi aliqua veniam nostrud. Aliqua excepteur non tempor velit ad amet cupidatat aliqua minim est elit cupidatat excepteur voluptate.

ipsum nulla quis

Ullamco ut nostrud aliqua ipsum id consequat exercitation deserunt occaecat sint qui consectetur commodo labore. Anim culpa adipisicing sunt do consectetur commodo. Irure magna magna duis non pariatur et elit ut. In mollit aliqua mollit minim velit eu dolor amet ex ea deserunt. Ad est culpa consectetur aute occaecat. Exercitation ex cillum do ut eiusmod eiusmod eiusmod aute irure aliqua aliqua laboris eu.

aliqua tempor ut nostrud

Dolore Lorem cillum incididunt ex est cillum est dolore labore minim. Sunt amet deserunt nostrud qui incididunt proident ullamco occaecat qui. Cillum fugiat reprehenderit incididunt magna fugiat exercitation officia culpa officia ullamco enim. Magna excepteur excepteur nulla quis veniam deserunt enim irure id reprehenderit. Ullamco ex nisi ut sint commodo quis tempor nulla voluptate. Sint ea quis pariatur sunt ad.

Official source

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

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 (25)

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.