高级算法 (Fall 2017)/Hashing and Sketching
From TCS Wiki
Revision as of 07:54, 20 September 2017 by
imported>Etone
(
→Heavy Hitter
)
(
diff
)
← Older revision
|
Latest revision
(
diff
) |
Newer revision →
(
diff
)
Jump to navigation
Jump to search
Contents
1
Count Distinct Elements
1.1
An estimator by hashing
1.2
Flajolet-Martin algorithm
2
Set Membership
2.1
Perfect hashing
2.1.1
FKS perfect hashing
2.1.2
Cuckoo hashing
2.2
Approximate set membership
2.2.1
Bloom filter
3
Frequency Estimation
3.1
Count-min sketch
Count Distinct Elements
An estimator by hashing
Flajolet-Martin algorithm
Set Membership
Perfect hashing
FKS perfect hashing
Cuckoo hashing
Approximate set membership
Bloom filter
Frequency Estimation
Count-min sketch
Navigation menu
Personal tools
Log in
Namespaces
Page
Discussion
English
Views
Read
View source
View history
More
Search
课程主页
首页
组合数学
随机算法
讨论班
近似算法讨论班
links
EtoneWiki
EddyWiki
Wikipedia
MathWorld
Nestia.com
Help
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information