News for hackers. Stuff that matters.
Re:Ask HN: what linear algebra do you use most often for pra... by omarish on Friday April 10, 2009 @10:16AM (#556059)
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

Re:Ask HN: what linear algebra do you use most often for pra... by jey on Friday April 10, 2009 @11:02AM (#556133)
I don't get it (at all). Can you elaborate?
Re:Ask HN: what linear algebra do you use most often for pra... by darkxanthos on Friday April 10, 2009 @02:33PM (#556539)
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)
Re:Ask HN: what linear algebra do you use most often for pra... by omarish on Friday May 15, 2009 @09:52PM (#611715)
accurate