Tracking more than 125 million Google+ Users and more than 1.5 million Pages


Research at Google

∀x, CS+x

Google is full of smart people working on some of the most difficult problems in computer science today. Most people know about the research activities that back our major products, such as search algorithms, systems infrastructure, machine learning, and programming languages. Those are just the tip of the iceberg; Google has a tremendous number of exciting challenges that only arise through the vast amount of data and sheer scale of systems we build.

What we discover affects the world both through better Google products and services, and through dissemination of our findings by the broader academic research community.  We value each kind of impact, and often the most successful projects achieve both.

300,561 -31
Research at Google +14.6 pluskred
Get embed code


Ranked: 375th in English Most Engaging This Week (by Engagement)

Ranked: 387th in English Most Engaging This Week (by Average Reach)

Ranked: 569th in English Pages (by Followers)

Ranked: 583rd in English Most Engaging This Month (by Engagement)

Ranked: 622nd in Most Engaging This Week (by Engagement)

Ranked: 624th in English Most Engaging This Week (by Shares)

Ranked: 627th in English Pages (by +1's)

Ranked: 725th in Most Engaging This Week (by Average Reach)

Ranked: 735th in English Most Engaging This Month (by Average Reach)

Ranked: 743rd in Pages (by Followers)

Ranked: 871st in Pages (by +1's)

Ranked: 922nd in English Most Engaging This Week (by Total Reach)

Ranked: 948th in Most Engaging This Month (by Engagement)

Ranked: 1004th in English Most Engaging This Week (by +1's)

Ranked: 1015th in Most Engaging This Week (by Shares)

Ranked: 1096th in English Most Engaging This Month (by Shares)

Ranked: 1387th in Most Engaging This Month (by Average Reach)

Ranked: 1475th in English Most Engaging This Week (by Comments)

Date Following Followers Gained
Recent Popular Posts
+298
76 Shares
About 5 days ago cross posted from the Google Research Blog

Launching the Quantum Artificial Intelligence Lab
Posted by +Hartmut Neven, Director of Engineering

We believe quantum computing may help solve some of the most challenging computer science problems, particularly in machine learning. Machine learning is all about building better models of the world to make more accurate predictions. If we want to cure diseases, we need better models of how they develop. If we want to create effective environmental policies, we need better models of what’s happening to our climate. And if we want to build a more useful search engine, we need to better understand spoken questions and what’s on the web so you get the best answer.

So today we’re launching the Quantum Artificial Intelligence Lab. NASA’s Ames Research Center will host the lab, which will house a quantum computer from D-Wave Systems (http://goo.gl/fIHvk), and the Universities Space Research Association (USRA, http://goo.gl/M6GmK) will i
+152
79 Shares
About 7 weeks ago This week we sat down with Google Software Engineer +Tiancheng Lou, known by many in the programming community by his handle “ACRush”. Tiancheng joined Google shortly after obtaining his PhD in Computer Science in 2011 from the Institute for Theoretical Computer Science at Tsinghua University in Beijing. 

This year marks the 10th anniversary of Google’s Code Jam, our annual international programming competition that draws some of the top amateur and professional talent in the world together to solve algorithmic puzzles. Code Jam registration is currently open (https://code.google.com/codejam), with the Qualification Round scheduled to begin on April 12th. With over 35,000 programming enthusiasts competing last year, we expect this year’s Code Jam to be even more exciting.

As a participant in five Code Jam competitions, and as the 1st place winner in 2008 and 2009, Tiancheng shares his experiences with Code Jam, his research and role at Google, and advice on how to come out on top in this
+149
82 Shares
About 4 weeks ago Ever wonder what some Googlers do in their spare time? +Tom Murphy VII  likes to create programs designed to learn how to play classic video games. Recently, during the 2013 ACH SIGBOVIK 2013 conference (http://sigbovik.org/2013/), Murphy (also known by his alias Tom 7) revealed his AI program designed to automatically play many old Nintendo Entertainment System games.  

In his paper “The First Level of Super Mario Bros. is Easy with Lexicographic Orderings and Time Travel … after that it gets a little tricky” (http://goo.gl/akUCf), Murphy details the process by which his programs deduce the right objective function by analyzing a human player’s inputs to a game. The assumption made is that successful progress, or “winning”, consists of the lexicographical ordering of certain memory locations (i.e. score, level, number of lives, character's x position on screen, etc.) increasing.   

While these lexicographical orderings should generally go up (like score or level), this may not alway
+141
48 Shares
About 5 weeks ago What does an 18th century scientist have to do with how Google Maps gives you the shortest route from your home to the dentist’s office?  Today marks the the 306th birthday of Leonhard Euler, a Swiss physicist and mathematician, who is credited with laying the foundation for the field of graph theory.  Taught to nearly all computer science students, graph theory continues to have profound impact to this day, with applications to a variety of fields ranging from videogames to social networks to city planning.  

Graph theory is the study of  the mathematical structures (graphs) used to model pairwise relations (edges) between objects (nodes or vertices).  Social networks (such as Google+) and road maps are good examples of graphs, where algorithms are continually developed to find the shortest path between objects or maximize the efficiency of network flows. As an example, graph algorithms are utilized by millions of people everyday when using Google maps to get directions from point A to point B.
+100
68 Shares
About 9 weeks ago What do steam engines have to do with computer programs?  The similarities between the two might surprise you.  In 1948, Claude Shannon derived a formula for the average information content of a message: 

-∑pᵢ*log(pᵢ)

Here,  pᵢ is the probability of the iᵗʰ message, and one sums over all possible messages received.  A related notion is Kolmogorov complexity, a way to characterize information focusing on the content of a single message, which is just the length of the shortest program that prints out the message.  

To explore the connection between Shannon information and Kolmogorov complexity, the authors of Algorithmic Thermodynamics +John Baez and former Googler +Mike Stay, investigate probability measures on sets of programs. Interestingly enough, the formula for Shannon information is similar to the formula for entropy in statistical mechanics, and allows one to apply the mathematics of classical thermodynamics to algorithmic entropy in order to investigate information gai
+86
33 Shares
About 6 weeks ago As self professed space enthusiasts, members of Google’s Data Arts team    +Jono Brandel, +Val Klump, and +Aaron Koblin (among others) have created 100,000 Stars, an interactive visualization of the local stellar neighborhood that includes accurate relative positions of, appropriately, ~120,000 stars.  

As an artistic interpretation of our location in the Milky Way galaxy (and thus not recommended for interstellar navigation), 100,000 Stars allows the user to zoom in and read more about 87 select stars within ~500 light years from the sun, as well as to view the entire sample of stars in the project according to their B - V color index (http://goo.gl/vmLaV). The Data Arts Team accomplished this by drawing upon numerous astrometric catalogues, including stellar position data from the European Space Agency’s HIPPARCOS mission, as well as imagery from NASA and multiple other science missions. 

As a showcase for web experiments built with open technologies, 100,000 Stars is just one of the m
+82
52 Shares
About 10 weeks ago Collaborating with UMass Amherst researchers Sameer Singh and Andrew McCallum, Google Research has released the Wikilinks Corpus, consisting of 40 million disambiguated mentions within roughly 10 million web pages.  By compiling the associations of unique wikipedia URLs (entities) linked to by the hypertext (anchors) of weblinks, the Wikilinks Corpus can help computers with the task of disambiguation (if someone says Stanford, are they referring to a university, a city, or a person?) -- something humans do incredibly well.

To read more about how to obtain the data, and ideas for what you can do with it, head over to the Research Blog post linked below

+78
46 Shares
About 2 weeks ago CHI 2013 Day 4: Vint Cerf and Ubiquitous Computing 

The last day of CHI 2013 has finished, bringing to a close four days of talks, panel discussions, and around 400 paper presentations. The latest research in fields ranging from mobile text input design to collaborative creation to spatial interfaces was on exhibition, showcasing the innovation across academia and industry that strives to make our integration with computing devices seamless and impactful. With such a plethora of research on how we interact with computing devices, and by extension the internet, it seemed only fitting that the closing plenary talk was given by Googler +vint cerf. Read on to hear his views on Human Computer Interaction, and his responses to questions from the audience.

Drawing on the the various themes presented at CHI 2013, Vint believes our cognitive sense of computing will change due to computing devices becoming increasingly prevalent in our daily lives. He described how we are already approaching this
+73
42 Shares
About 10 weeks ago If you hear Travis’ “Hit Me Baby One More Time”, you might immediately know it’s a cover of the Britney Spears song, even though the tempo, instrumentation, and arrangement are all strikingly different.  Our brains, excellent pattern recognition devices, are able to easily pinpoint similar melodies even when many of the other audio characteristics of a song are quite dissimilar.  But, can computers listen to, and recognize, music the same way we do?

To help computers do just that, Googlers Thomas Walters, David Ross, and Richard Lyon built a system capable of identifying the melodic similarity between any two audio tracks.  It does this with the help of what they call an intervalgram, a depiction of the correlation between two songs, sets of which form the basis of a system for detection of similar or identical melodies across a database of music.

A heat map showing intervalgram similarity of both versions of Baby Hit Me One More Time is shown below, where the horizontal and vertical axe
+66
41 Shares
About 5 weeks ago Last week on Google Developers Live, +Arun Nagarajan sat down with +Sreeram Balakrishnan and +Warren Shen to talk about Fusion Tables (http://goo.gl/KQRpL) and Apps Script (http://goo.gl/blK8M). In addition to being a good introduction to both Apps Script and Fusion Tables, the video demonstrates how to use Apps Script to connect with the Fusion Tables API in order to upload, merge, query, and share data sets, enabling users to create compelling visualizations and publish the results on the Web.

To see upcoming Google Developers Live content, visit https://developers.google.com/live/

To learn how to use Apps Script with the Fusion Tables API, watch the video below!