You can save a ton of time by formulating a linear algebra problem as a shortest path problem; you can end up using dijkstra's algorithm to enumerate the possible solutions.
He's saying basically, instead of manipulating a bunch of data algebraically to get the exactly provably right answer you can use this other algo to get you a damn good answer faster. (I think)
Comments
You can save a ton of time by formulating a linear algebra problem as a shortest path problem; you can end up using dijkstra's algorithm to enumerate the possible solutions.
http://en.wikipedia.org/wiki/Knapsack_problem
I don't get it (at all). Can you elaborate?
He's saying basically, instead of manipulating a bunch of data algebraically to get the exactly provably right answer you can use this other algo to get you a damn good answer faster. (I think)
accurate