Publication

Distributed link-based ranking in P2P Web retrieval

Publications associées (100)

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

Concept expansion using semantic fisheye views

Pearl Pu Faltings, Vincent Jean Fabrice Schickel

Exploratory search over a collection often requires users to iteratively apply a variety of strategies, such as searching for more general or more specific concepts in reaction to the information they encounter. Rich semantic models, such as WordNet, are p ...

Springer Verlag, Heidelberg, D-69121, Germany2005

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

Using SiteRank for P2P Web Retrieval

Karl Aberer, Jie Wu

Studies of the Web graph at the granularity of documents have revealed many interesting link distributions. Similarly, studies of the Web graph at the granularity of Web sites, the so-called hostgraph, revealed relationships among hosts based on linkage an ...

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

The past, present, and future of web information retrieval

Monika Henzinger

In this article we describe the approach taken by the first web search engines, discuss the state of the art, and present some of the challenges for the future. ...

2004

Experience Implementing Caching of Dynamic Web Content with AOP

Willy Zwaenepoel

Caching is an appealing approach for server-side acceleration of dynamic content web sites. Previous work in this area provides either non-transparent caching obtained at the expense of considerable effort from the application programmer, or a transparent ...

2003

Lightweight Probabilistic Broadcast

Rachid Guerraoui, Sidath Handurukande, Patrick Eugster

The growing interest in peer-to-peer applications has underlined the importance of scalability in modern distributed systems. Not surprisingly, much research effort has been invested in gossip-based broadcast protocols. These trade the traditional strong r ...

2003

Specification and Implementation of Dynamic Web Site Benchmarks

Willy Zwaenepoel, Sameh Mohamed Elnikety, Emmanuel Cecchet

The absence of benchmarks for Web sites with dynamic content has been a major impediment to research in this area. We describe three benchmarks for evaluating the performance of Web sites with dynamic content. The benchmarks model three common types of dyn ...

2002

Semi-automatic generation of web-based computing environments for software libraries

Daniel Kressner

A set of utilities for generating web computing environments related to mathematical and engineering library software is presented. The web interface can be accessed from a standard world wide web browser with no need for additional software installations ...

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2002

Self-Organizing Subsets: From Each According to His Abilities, To Each According to His Needs

Dejan Kostic

The key principles behind current peer-to-peer research include fully distributing service functionality among all nodes participating in the system and routing individual requests based on a small amount of locally maintained state. The goals extend much ...

2002