1 / 1

An Optimal Algorithm for the Distinct Elements Problem

An Optimal Algorithm for the Distinct Elements Problem. Inspired by [Bar- Yossef et al. 2002]. 1 17 2 4 17 9 2 5 1 1 4 6. 1/ ε 2. 1. 2. 3. h:{1,…,n} {1,…,log n}. 4. Pr[h( i ) = j] = 1/2 j. …. 5. …. log n. 4. 3. 4. 3. 4. 5. 2.

kairos
Download Presentation

An Optimal Algorithm for the Distinct Elements Problem

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. An Optimal Algorithm for the Distinct Elements Problem Inspired by [Bar-Yossef et al. 2002] 11724 17 9 2 5 1 1 4 6 1/ε2 1 2 3 h:{1,…,n} {1,…,log n} 4 Pr[h(i) = j] = 1/2j … 5 … log n 4 3 4 3 4 5 2 g:{1,…,n} {1,…,1/ε2} MIT Computer Science and Artificial Intelligence Laboratory, Theory of Computation Group

More Related