Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
Lecture
Distinct Elements: Count and Hash Functions
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.
Official source
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.