Concept

Search engine indexing

Related publications (99)

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 Highly Discriminative Keys for Indexing in a Peer-to-Peer Full-Text Retrieval System

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

Excessive network bandwidth consumption, caused by the transmission of long posting lists, was identified as one of the major bottlenecks for implementing distributed full-text retrieval in a Peer-to-Peer (P2P) architecture. To address this problem we intr ...

2005

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

Aggregation of a Term Vocabulary for Peer-to-Peer Information Retrieval: a DHT Stress Test

Karl Aberer, Fabius Klemm

There has been an increasing research interest in developing full-text retrieval based on peer-to-peer (P2P) technology. So far, these research efforts have largely concentrated on efficiently distributing an index. However, ranking of the results retrieve ...

2005

Efficient processing of XPath queries with structured overlay networks

Karl Aberer, Manfred Hauswirth, Gleb Skobeltsyn

Non-trivial search predicates beyond mere equality are at the current focus of P2P research. Structured queries, as an important type of non-trivial search, have been studied extensively mainly for unstructured P2P systems so far. As unstructured P2P syste ...

2005

Efficient processing of XPath queries with structured overlay networks

Karl Aberer, Manfred Hauswirth, Gleb Skobeltsyn

2005

Network of Shortcuts: An Adaptive Data Structure for Tree-Based Search Methods

Andrea Bergamini

In this work we present a novel concept of augmenting a search tree in a packet-processing system with an dditional data structure, a Network of Shortcuts, in order to adapt the search to current input traffic patterns and significantly speed-up the freque ...

2005

An Online Audio Indexing System

Hervé Bourlard, Jitendra Ajmera

This paper presents overview of an online audio indexing system, which creates a searchable index of speech content embedded in digitized audio files. This system is based on our recently proposed offline audio segmentation techniques. As the data arrives ...

2004

Text Detection and Recognition in Images and Videos

Hervé Bourlard, Jean-Marc Odobez, Datong Chen

Text embedded in images and videos represents a rich source of information for content-based indexing and retrieval applications. In this paper, we present a new method for localizing and recognizing text in complex images and videos. Text localization is ...

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

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.