Computing with Randomness: Probability Theory and the Internet

November 12, 2010 · 1 comment

GD Star Rating
loading...

Probability theory is not typically an idea one associates with computing, but in the recent years it has become central to many of the problems that occur in computing. Dr. Mehran Sahami is an Associate Professor of Computer Science at Stanford University who helps us understand the new role probability theory is playing.

In this lecture, Sahami gives us clear examples on the use of probability theory in computing and discusses the applications, like web search and spam filtering, which are making use of it.

Computing with Randomness: Probability Theory and the Internet, 10.0 out of 10 based on 2 ratings Instructor:
Location:
Length:
Subjects: Computer Science, Mathematics
Tags:
Share with friends:
  • Print
  • Digg
  • del.icio.us
  • Facebook
  • Mixx
  • Google Bookmarks
  • LinkedIn
  • Reddit
  • StumbleUpon
  • Tumblr
  • Twitter
Keep up with new videos daily through RSS or Email

Previous post:

Next post:

{ 1 comment… read it below or add one }

James Strand September 22, 2011 at 11:45 am

If the odds are one in four that one will guess or pick correctly, and an X would signify a correct pick; then one who picks every time will probably average a correct pick every 4 times. Within these odds we will show an average (where we show at least one miss) an average of 4 misses between the last X and the next X… X0000X… with a legitimate concept allowing one to just passively view or not pick at that first miss we are then on our way to 4 picks to X (without) pairing or picking correctly successively. We are on our way to +3. Prove me wrong….

Reply

Leave a Comment