Concept

Full-text search

Related publications (76)

Web Text Retrieval with a P2P Query-Driven Index

Karl Aberer, Martin Rajman, Vinh Toan Luu, Ivana Podnar, Gleb Skobeltsyn

In this paper, we present a query-driven indexing/retrieval strategy for efficient full text retrieval from large document collections distributed within a structured P2P network. Our indexing strategy is based on two important properties: (1) the generate ...

2007

Scalable Peer-to-Peer Web Retrieval with Highly Discriminative Keys

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

The suitability of peer-to-peer (P2P) approaches for full-text Web retrieval has recently been questioned because of the claimed unacceptable bandwidth consumption induced by retrieval from very large document collections. In this contribution we formalize ...

IEEE2007

A window-based automatic hardware/software partitioning heuristic

Hadi Parandeh Afshar

System-level design decisions such as HW/SW partitioning, target architecture selection and scheduler selection are some of the main concerns of current complex system-on-chip (SOC) designs. In this paper, a novel window-based heuristic is proposed that ad ...

2007

A Discriminative Kernel-based Model to Rank Images from Text Queries

Samy Bengio, David Grangier

This paper introduces a discriminative model for the retrieval of images from text queries. Our approach formalizes the retrieval task as a ranking problem, and introduces a learning procedure optimizing a criterion related to the ranking performance. The ...

IDIAP2007

Google Portrait

Sébastien Marcel

This paper presents a system to retrieve and browse images from the Internet containing only one particular object of interest: the human face. This system, called Google Portrait, uses Google Image search engine to retrieve images matching a text query an ...

IDIAP2007

Query-Driven Indexing for Peer-to-Peer Text Retrieval

Karl Aberer, Martin Rajman, Vinh Toan Luu, Ivana Podnar, Gleb Skobeltsyn

We present a query-driven algorithm for the distributed indexing of large document collections within structured P2P networks. To cope with the bandwidth consumption problem that has been identified as the major issue for the standard distributed approach ...

2006

Learning to Retrieve Images from Text Queries with a Discriminative Model

Samy Bengio, David Grangier, Florent Monay Michaud

This work presents a discriminative model for the retrieval of pictures from text queries. The core idea of this approach is to minimize a loss directly related to the retrieval performance of the model. For that purpose, we rely on a ranking loss which ha ...

2006

Learning to Retrieve Images from Text Queries with a Discriminative Model

Samy Bengio, David Grangier, Florent Monay Michaud

IDIAP2006

A Discriminative Approach for the Retrieval of Images from Text Queries

Samy Bengio, David Grangier, Florent Monay Michaud

This work proposes a new approach to the retrieval of images from text queries. Contrasting with previous work, this method relies on a discriminative approach: the parameters are selected in order to minimize a loss related to the ranking performance of t ...

IDIAP2006

Scalable Peer-to-Peer Web Retrieval with Highly Discriminative Keys

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

The suitability of Peer-to-Peer (P2P) approaches for full-text web retrieval has recently been questioned because of the claimed unacceptable bandwidth consumption induced by retrieval from very large document collections. In this contribution we present a ...

2006

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.