Complementarity of PPC and SEO


At first PPC is more interesting, then SEO becomes the solution after a while. At least that’s what this nice infographic from elliance is saying.
Read MoreAt first PPC is more interesting, then SEO becomes the solution after a while. At least that’s what this nice infographic from elliance is saying.
Read MoreFor more information, you should go on the conference website. It’s in Australia, a very nice venue! Tremendous advances in processing, communication and systems/middleware technologies are leading to new paradigms and platforms for computing, ranging from computing Clusters to widely distributed Grid and emerging Clouds. CCGrid is a series of very successful conferences, sponsored by the IEEE Computer Society Technical Committee on Scalable Computing (TCSC) and ACM, with the overarching goal of bringing together international researchers, developers, and users and to provide an international forum to present leading research activities and results on a broad range of topics related to […]
Read MoreAccording to Wikipedia, Social Psychology : « is a type of social science that is concerned with individuals’ thoughts, feelings and behaviour as they affect or are affected by other individuals… » and which « studies the interactions between individuals in a group, a society or in different organisations ». How true is that definition? I’m not sure, but what I do understand is that when I read texts about social psychology they give us the key to understanding what motivates us to undertake specific actions. At this stage you should understand what I’m aiming at: how do we get people to do what […]
Read MoreA few years ago, I worked together with Yves Verhoeven on the problem of testing triangular properties. We did some proofs, wrote a few pages but decided not to publish our work (since it is far from being optimal, and also far from being really interesting). However I think that this is worth a few lines in this blog. It is clearly more technical than the average post of my blog, so don’t force yourself into reading it. Let $latex K_n=(V,E)$ be the complete graph on $latex n$ vertices and $latex S$ be a set. Let $latex \phi:V\times V\rightarrow S$ […]
Read MoreI was talking recently to three excellent engineers from Yahoo, Google and Microsoft this week, and that reminded me that I meant to do this post a little while ago. So I’ll keep this post short and sweet: if you’re an excellent Yahoo or Google or Microsoft engineer with solid experience in everything, I am hiring. If you want to apply for a Research Engineer position in the beautiful town of Orsay (France), use my e-mail and we won’t need recruiters to discuss. Thanks! The beginning of this post remind you of something? yes, sure, it’s a pastiche of this […]
Read MoreA friend recently asked me to explain her the concept behind MapReduce. The last time we saw each other, I had no time to do that, so I now use my blog for this purpose. Map and reduce are particular functions that can be found we in numerous functional languages (such as python, ocaml, etc.). Map is a function that takes as input an other function, let’s say $latex f$ and a data structure (most of the time a sequence), that calls the function $latex f$ on each of the structure’s items and returns a list of the return values. […]
Read MoreI will probably wrote one day about the folklore in SEO about the colour of the hats (white hats follow Google guidelines, black hats don’t, and grey hats are neutral), anyway the goal of my post is to present this infographic by seomoz. The original post is here. I won’t discuss about the graphic, but I’m pretty sure you can guess from it that the author (randfish, « a self-proclaimed professional white-hat SEO« ) is not a big fan of black hat techniques.
Read MoreHere is a brute force copy of a part of the call for papers for WWW2010, probably the most famous conference in the field. The complete call for papers is here. WWW2010, the premier international conference on Web research, calls for outstanding submissions along the following tracks: Original and creative research papers, theoretical and/or practical “Application and experience” papers involving novel, large, deployed systems Tutorial proposals on any topic of interest to the community Workshop proposals on any topic that is strongly related to WWW, but too nascent to cover thoroughly in the main conference Demonstrations of potentially high-impact, innovative […]
Read MoreThis is the last of the three posts about recommendation systems, the first can be found here, the second here. In order to validate the effectiveness of our approach we decided to make an experiment with actual products and users. For this purpose we collected from a french medias reviews website krinein a sample of 4400 movies. From these 4400 movies, we selected uniformly at random 160 of them. This was the data set for our experiment. We then extract uniformly at random from this data set 9 movies. These 9 movies were our witness products set. Our methodology was […]
Read MoreThis is the second post about recommendation systems, the first one can be found here. It is pretty obvious that the goal of a recommendation system is to provide users with « good » products. I am going to first introduce our notations and then explain what is a good recommendation in our framework. In the work done with Sebastien hemon and Thomas Largillier, we consider that users belong to a set $latex \mathcal{U} = \{ u_{1} \cdots u_{m} \}$ of $latex m$ distinct users and that products come from $latex \mathcal{P} =\{ p_{1} \cdots p_{n} \}$, a set of $latex n$ […]
Read More