Takashi's Notes

Home

❯

courses

❯

algorithms for big data

❯

low rank approximation, column based matrix reconstruction, k means, compressed sensing

low-rank approximation, column-based matrix reconstruction, k-means, compressed sensing

May 22, 20231 min read

low-rank approximation, column-based matrix reconstruction, k-means, compressed sensing

Prev: oblivious-subspace-embeddings-faster-iterative-regression-sketch-and-solve-regression Next: rip-and-connection-to-incoherence-basis-pursuit-krahmer-ward-theorem

Prev: oblivious-subspace-embeddings-faster-iterative-regression-sketch-and-solve-regression Next: rip-and-connection-to-incoherence-basis-pursuit-krahmer-ward-theorem


Graph View

Backlinks

  • oblivious subspace embeddings, faster iterative regression, sketch-and-solve regression
  • RIP and connection to incoherence, basis pursuit, Krahmer-Ward theorem

Created with Quartz v4.5.1 © 2025

  • Homepage
  • GitHub
  • RSS
  • Sitemap