Takashi's Notes

Home

❯

courses

❯

algorithms for big data

❯

CountMin sketch, point query, heavy hitters, sparse approximation

CountMin sketch, point query, heavy hitters, sparse approximation

May 22, 20231 min read

CountMin sketch, point query, heavy hitters, sparse approximation

Prev: analysis-of-ℓp-estimation-algorithm-via-max-stability-deterministic-point-query-via-incoherent-matrices Next: countsketch-ℓ0-sampling-graph-sketching

Prev: analysis-of-ℓp-estimation-algorithm-via-max-stability-deterministic-point-query-via-incoherent-matrices Next: countsketch-ℓ0-sampling-graph-sketching


Graph View

Backlinks

  • analysis of ℓp estimation algorithm via max-stability, deterministic point query via incoherent matrices
  • CountSketch, ℓ0 sampling, graph sketching

Created with Quartz v4.5.1 © 2025

  • Homepage
  • GitHub
  • RSS
  • Sitemap