Publications related to 5e{x+y}: Searching over Mathematical Content in Digital Libraries

Related publications (12)

Single-server Multi-message Private Information Retrieval with Side Information: the General Cases

The single-server multi-message private information retrieval with side information problem is studied for general cases. In this problem, K independent messages are stored at a single server. One user initially has M messages as side information and wants ...

IEEE2020

Caching and Distributed Storage : Models, Limits and Designs

Saeid Sahraei

A simple task of storing a database or transferring it to a different point via a communication channel turns far more complex as the size of the database grows large. Limited bandwidth available for transmission plays a central role in this predicament. I ...

EPFL2018

Analytical expression and experimental validation of the Brillouin gain spectral broadening at any sensing spatial resolution

Luc Thévenaz, Marcelo Alfonso Soto Hernandez, Mohammad Mehdi Alem Karladani

A novel and simple analytical expression to describe the Brillouin gain spectral broadening as a function of the spatial resolution in time-domain Brillouin distributed fiber sensors is deduced. The proposed model is experimentally validated using a pump-p ...

Ieee2017

Selection and Aggregation of Ranking Criteria for Retrieval from Scientific Publication Databases

Martin Veselý

Selection and aggregation of ranking criteria became an important topic in information retrieval as search is getting more specialized and as volume of electronically available information grows. In this context, document ranking has undergone a shift from ...

EPFL2012

Analysis of the Second Moment of the LT Decoder

Mohammad Amin Shokrollahi, Ghid Maatouk

In this paper, the second moment of the ripple size during the Luby transform (LT) decoding process is analyzed. Combined with a result by Karp et al. (2004) stating that the expectation of the ripple size is of the order of k, our study gives bounds on th ...

2012

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

Karl Aberer, Martin Rajman, Vinh Toan Luu, 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 ...

2009

Query-driven indexing in large-scale distributed systems

Gleb Skobeltsyn

Efficient and effective search in large-scale data repositories requires complex indexing solutions deployed on a large number of servers. Web search engines such as Google and Yahoo! already rely upon complex systems to be able to return relevant query re ...

EPFL2009

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

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

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

2009

Sharing of probabilistically correlated data in peer-to-peer networks

The impact of Peer-to-Peer (P2P) networks on the Internet landscape is undisputed. It has led to a series of new applications, e.g., as part of the so-called Web 2.0. The shift from the classical client-server based paradigm of the Internet, with a clear d ...

EPFL2008

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

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

We describe a query-driven indexing framework for scalable text retrieval over structured P2P networks. To cope with the bandwidth consumption problem that has been identified as the major obstacle for full-text retrieval in P2P networks, we truncate posti ...

2007

Distributed Cache Table: Efficient Query-Driven Processing of Multi-Term Queries in P2P Networks

Karl Aberer, Gleb Skobeltsyn

The state-of-the-art techniques for processing multi-term queries in P2P environments are query flooding and inverted list intersection. However, it has been shown that due to scalability reasons both methods fail to support full-text search in large scale ...

2006

Caching Dynamic Web Content: Designing and Analysing an Aspect-Oriented Solution

Willy Zwaenepoel

Caching dynamic web content is an effective approach to reduce Internet latency and server load. An ideal caching solution is one that can be added transparently by the developers and provides complete consistency of the cached documents, while minimizing ...

2006