As we have seen in class, monte carlo methods of estimating things converge rather slowly. So, to get a relatively accruate result, we must use many many data points. Such a way of calculating desired results often requires supercomputers.
however, I found a paper on how to use Grid-computing to help solve some of this problem. […]
Author Archive
Grid-computing with Monte Carlo applications
Friday, April 25th, 2008 7:12 pm
Written by: Quesadilla
Topic Analysis using Nonnegative Matrix Factorization
Saturday, March 22nd, 2008 6:37 pm
Written by: Quesadilla
I found a paper written by Michael W. Berry and Murray Browne on how to use non-negative matrix factorization to do topic extraction and email surveillance.
according to the article, non-negative matrix factorization (NMF),
“is a vector space method used to obtain a
representation of data using non-negativity constraints.
These constraints can lead to a parts-based representation
because they allow […]
Posted in Topics: Uncategorized
Project 1, a potential Oscar winner?
Monday, March 3rd, 2008 7:36 pm
Written by: Quesadilla
while searching for some topic to write about, I found this article on http://www.scientific-computing.com/.
the article is titled And the Oscar goes to…a computer scientist?, which tells us about the computer scientist, Ron Fedkiw, who won an Oscar for special effects in movies, especially simulating the movements of water. He has so far worked on […]
Posted in Topics: Uncategorized






Posted in Topics: Uncategorized
Add a Comment »