Mathematics at Google
research.google.com
Mathematics at Google
1–10 of 51 posts
Re: Mathematics at Google
#2Re: Mathematics at Google
#3It just goes to show, Google steals content without attribution just like everyone else.
Re: Mathematics at Google
#4Re: Mathematics at Google
#5Do they still heavily rely on PageRank? With the amount of traffic data Google has, I would expect more statistical approaches based on what users click (rather than graph algorithms based on how the web is linked) to be the backbone for ranking their results.
Re: Mathematics at Google
#6Look at the slide entitled Gmail (5), and compare the picture with the first graph on my blog post http://jeremykun.wordpress.com/2011/08/11/the-perceptron-and... It just goes to show, Google steals content without attribution just like everyone else.
Re: Mathematics at Google
#7Look at the slide entitled Gmail (5), and compare the picture with the first graph on my blog post http://jeremykun.wordpress.com/2011/08/11/the-perceptron-and... It just goes to show, Google steals content without attribution just like everyone else.
Re: Mathematics at Google
#8Do they still heavily rely on PageRank? With the amount of traffic data Google has, I would expect more statistical approaches based on what users click (rather than graph algorithms based on how the web is linked) to be the backbone for ranking their results.
PageRank is definitely still used, although it's doubtfully the sole determinant of ranking results. See http://jeremykun.wordpress.com/2011/06/21/googles-page-rank-...
Re: Mathematics at Google
#9Re: Mathematics at Google
#10My day-to-day programming consists so much of process and simple boolean logic that I hardly ever use math more challenging than 1 + 1 and 1 != 0. It's great to review how math can greatly influence the potential of your code.
A SAT solver[1] can automatically figure out a range of acceptable solutions for your conditions. 'I want this goal, is there a way to make that happen?' Security people love this. SMT solvers are even crazier[2] and can automatically determine solutions to linear equations or inequalities (this comes in handy when analyzing loops). Z3 has an online version at [3].
Also, if you have a lot of nasty cascaded if-statements, a K-map[4] and espresso[5] can reduce those down to a minimal set of branches. Note that fewer branches means fewer branch prediction penalties, which means faster code!
[1] http://en.wikipedia.org/wiki/Boolean_satisfiability_problem
[2] http://media.tumblr.com/tumblr_m8ywn1iesH1r6uu3b.gif
[3] http://rise4fun.com/z3/tutorial/guide
[4] http://en.wikipedia.org/wiki/Karnaugh_map
[5] http://embedded.eecs.berkeley.edu/pubs/downloads/espresso/in... and ftp://ftp.cs.man.ac.uk/pub/amulet/balsa/other-software/espresso-ab-1.0.tar.gz