Takashi's Notes

Home

❯

courses

❯

algorithms for big data

❯

CountSketch, ℓ0 sampling, graph sketching

CountSketch, ℓ0 sampling, graph sketching

May 22, 20231 min read

CountSketch, ℓ0 sampling, graph sketching

Prev: countmin-sketch-point-query-heavy-hitters-sparse-approximation Next: amnesic-dynamic-programming-approximate-distance-to-monotonicity

Prev: countmin-sketch-point-query-heavy-hitters-sparse-approximation Next: amnesic-dynamic-programming-approximate-distance-to-monotonicity


Graph View

Backlinks

  • amnesic dynamic programming (approximate distance to monotonicity)
  • CountMin sketch, point query, heavy hitters, sparse approximation

Created with Quartz v4.5.1 © 2025

  • Homepage
  • GitHub
  • RSS
  • Sitemap