Skip to main navigation
Skip to search
Skip to main content
University of Copenhagen Research Portal Home
Help & FAQ
Dansk
English
Home
Profiles
Research output
Research units
Press/Media
Activities
Prizes
???studenttheses???
Datasets
Search by expertise, name or affiliation
Bottom-k and priority sampling, set similarity and subset sums with minimal independence
Mikkel Thorup
Department of Computer Science
15
Citations (Scopus)
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Bottom-k and priority sampling, set similarity and subset sums with minimal independence'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
2-independence
20%
Constant Bias
20%
Input Weight
20%
Jaccard Similarity
20%
Priority Sampling
100%
Random Hashing
20%
Sampling Set
100%
Union Bound
20%
Mathematics
Constant Factor
20%
Error Bound
20%
Hash Function
100%
Probability Theory
20%
Relative Error
40%
Subset Sum
100%
Computer Science
Classic Approach
20%
Constant Factor
20%
Hash Function
100%
Hashing
80%
Jaccard Similarity
20%
Relative Error
40%