Publication

Combinatorial algorithms for web search engines: three success stories

Publications associées (20)

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

Synthesis, modeling, and experimental validation of distributed robotic search

James Pugh

The work of this thesis centers around the research subject of distributed robotic search. Within the field of distributed robotic systems, a task of particular interest is attempting to locate one or more targets in a possibly unknown environment. While n ...

EPFL2008

A Model of Search Intermediaries and Paid Referrals

Thomas Alois Weber

In this paper we pursue three main objectives: (1) to develop a model of an intermediated search market in which matching between consumers and firms takes place primarily via paid referrals; (2) to address the question of designing a suitable mechanism fo ...

2007

Search Technologies for the Internet

Monika Henzinger

About 20% of the world's population uses the web, and a large majority thereof uses web search engines to find information. As a result many web researchers are devoting much effort to improving the speed and capabilitiy of search technology. ...

2007

Distributed link-based ranking in P2P Web retrieval

Jie Wu

One of the main differences between modern search engines and traditional ones is the adoption of link-based ranking algorithm in ordering Web documents. Google has claimed that it is its link-based ranking algorithm, PageRank that has made the quality of ...

EPFL2006

Building a peer-to-peer full-text Web search engine with highly discriminative keys

Karl Aberer, Martin Rajman, Vinh Toan Luu, Ivana Podnar, Fabius Klemm

Web search engines designed on top of peer-to-peer (P2P) overlay networks show promise to enable attractive search scenarios operating at a large scale. However the design of effective indexing techniques for extremely large document collections still rais ...

2005

Using a Layered Markov Model for Decentralized Web Ranking

Karl Aberer, Jie Wu

The link structure of the Web graph is used in algorithms such as Kleinberg's HITS and Google's PageRank to assign authoritative weights to Web pages and thus rank them. In HITS, a solid theoretical model is lacking and the algorithm often leads to non-uni ...

2004

Opportunistic Search with Semantic Fisheye Views

Pearl Pu Faltings

Search goals are often too complex or poorly defined to be solved in a single query. While refining their search goals, users are likely to apply a variety of strategies, such as searching for more general or more specific concepts in reaction to the infor ...

2004

Towards a Foundation Model for Peer-to-Peer Web Information

Karl Aberer, Jie Wu

We find that there lacks a formal algebraic framework in the research area of P2P information retrieval. Such a formal framework is indispensable and pivotal. On the one hand, no solid theoretical foundation can explain why the results of many ad-hoc comme ...

2004

Hyperlink analysis for the Web

Monika Henzinger

Hyperlink analysis algorithms significantly improve the relevance of the search results on the Web, so much so that all major Web search engines claim to use some type of hyperlink analysis. However, the search engines do not disclose details about the typ ...

2001

Finding related pages in the World Wide Web

Monika Henzinger

When using traditional search engines, users have to formulate queries to describe their information need. This paper discusses a different approach to Web searching where the input to the search process is not a set of query terms, but instead is the URL ...

1999