Tweet Notes (CSE 494/598 F11)
This will contain collectively generated notes
Tuesday, September 20, 2011
09/20/2011
SVD computation is of complexity O(km^2n+k'n^3) for m*n matrix. This takes a lot of time and hence it is not used in practice.
-Bharath
Newer Post
Older Post
Home