高级算法 (Fall 2022)/Hashing and Sketching: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

3 October 2022

  • curprev 15:4815:48, 3 October 2022‎ Etone talk contribs‎ 25,717 bytes +25,717‎ Created page with "=Distinct Elements= Consider the following problem of '''counting distinct elements''': Suppose that <math>\Omega</math> is a sufficiently large universe. *'''Input:''' a sequence of (not necessarily distinct) elements <math>x_1,x_2,\ldots,x_n\in\Omega</math>; *'''Output:''' an estimation of the total number of distinct elements <math>z=|\{x_1,x_2,\ldots,x_n\}|</math>. A straightforward way of solving this problem is to maintain a dictionary data structure, which costs..."
Retrieved from "https://tcs.nju.edu.cn/wiki/index.php?title=高级算法_(Fall_2022)/Hashing_and_Sketching"