Fingerprints for highly similar streams
From MaRDI portal
Publication:498399
DOI10.1016/j.ic.2015.06.001zbMath1329.68101OpenAlexW2221439497MaRDI QIDQ498399
Publication date: 28 September 2015
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2015.06.001
Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Information storage and retrieval of data (68P20)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The frequent items problem, under polynomial decay, in the streaming model
- The space complexity of approximating the frequency moments
- Min-wise independent permutations
- Randomized geometric algorithms and pseudorandom generators
- A Small Approximately Min-Wise Independent Family of Hash Functions
- Approximate sparse recovery
- Pattern Matching in Multiple Streams
- Exponential Space Improvement for minwise Based Algorithms
- Fingerprinting Ratings for Collaborative Filtering — Theoretical and Empirical Analysis
- Sketching Algorithms for Approximating Rank Correlations in Collaborative Filtering Systems
- Improved Sketching of Hamming Distance with Error Correcting
- Universal hashing and k-wise independent random variables via integer arithmetic without primes
- Exact and Approximate Pattern Matching in the Streaming Model
- Sketching for Big Data Recommender Systems Using Fast Pseudo-random Fingerprints
- Summarizing data using bottom-k sketches
- Fast moment estimation in data streams in optimal space
- Bottom-k and priority sampling, set similarity and subset sums with minimal independence
- Homomorphic fingerprints under misalignments
