Publications related to A Peer-to-Peer Architecture for Information Retrieval Across Digital Library Collections

Promoting synergies for sustainability through peer-to-peer sharing: an analysis of drivers and barriers

Claudia Rebeca Binder Signer, Ralph Hansmann

Peer-to-peer (P2P) sharing may foster sustainability synergistically by saving resources, reducing costs and promoting satisfaction of consumer needs and social connectivity. A survey of Swiss and Swedish consumers (N = 1522) was conducted to analyze drive ...

TAYLOR & FRANCIS INC2023

From scattered sources to comprehensive technology landscape : A recommendation-based retrieval approach

Karl Aberer, Chi Thang Duong

Mapping the technology landscape is crucial for market actors to take informed investment decisions. However, given the large amount of data on the Web and its subsequent information overload, manually retrieving information is a seemingly ineffective and ...

ELSEVIER2023

Fair Incentivization of Bandwidth Sharing in Decentralized Storage Networks

Verónica del Carmen Estrada Galiñanes

Peer-to-peer (p2p) networks are not independent of their peers, and the network efficiency depends on peers contributing resources. Because shared resources are not free, this contribution must be rewarded. Peers across the network may share computation po ...

IEEE COMPUTER SOC2022

Graph Embedding for Retrieval

Chi Thang Duong

Information retrieval (IR) systems such as search engines are important for people to find what they need among the tremendous amount of data available in their organization or on the Internet. These IR systems enable users to search in a large data collec ...

EPFL2022

Policy-based Exploration of Equilibrium Representations (PEER): A topology grammar for generative conceptual structural design

Ioannis Mirtsopoulos

Design exploration is a creative process that consists of the incremental generation of design candidates. Supported by digital means or not, the process handles the ill-structured nature of design and allows creativity to flourish through diversity of des ...

EPFL2022

The Universal Gossip Fighter

Rachid Guerraoui, Anne-Marie Kermarrec, Anastasiia Kucherenko, Rafaël Benjamin Pinot

The notion of adversary is a staple of distributed computing. An adversary typically models “hostile” assumptions about the underlying distributed environment, e.g., a network that can drop messages, an operating system that can delay processes or an attac ...

IEEE2022

Information Retrieval Under Network Uncertainty: Robust Internet Ranking

Ralf Seifert, Anna Timonina-Farkas

Internet ranking algorithms play a crucial role in information technologies and numerical analysis due to their efficiency in high dimensions and wide range of possible applications, including scientometrics and systemic risk in finance (SinkRank, DebtRank ...

2023

An Improved Analysis of Local Search for Max-Sum Diversification

Rico Zenklusen, Friedrich Eisenbrand, Alfonso Bolívar Cevallos Manzano

We present new techniques to analyze natural local search algorithms for several variants of the max-sum diversification problem which, in its most basic form, is as follows: given an n-point set X subset of R-d and an integer k, select k points in X so th ...

INFORMS2019

Multimodal person recognition in audio-visual streams

Do Hoang Nam Le

Multimedia databases are growing rapidly in size in the digital age. To increase the value of these data and to enhance the user experience, there is a need to make these videos searchable through automatic indexing. Because people appearing and talking in ...

EPFL2019

New Multi-Keyword Ciphertext Search Method for Sensor Network Cloud Platforms

Jiyong Zhang, Hongyu Yang, Yue Wang

This paper proposed a multi-keyword ciphertext search, based on an improved-quality hierarchical clustering (MCS-IQHC) method. MCS-IQHC is a novel technique, which is tailored to work with encrypted data. It has improved search accuracy and can self-adapt ...

MDPI2018

Practical Private Range Search in Depth

Ioannis Demertzis, Odysseas Papapetrou

We consider a data owner that outsources its dataset to an untrusted server. The owner wishes to enable the server to answer range queries on a single attribute, without compromising the privacy of the data and the queries. There are several schemes on “pr ...

2018

PerfIso: Performance Isolation for Commercial Latency-Sensitive Services

Sameh Mohamed Elnikety, Calin Iorgulescu

Large commercial latency-sensitive services, such as web search, run on dedicated clusters provisioned for peak load to ensure responsiveness and tolerate data center outages. As a result, the average load is far lower than the peak load used for provision ...

The USENIX Association2018

PerfIso: Performance Isolation for Commercial Latency-Sensitive Services

Sameh Mohamed Elnikety, Calin Iorgulescu

Large commercial latency-sensitive services, such as web search, run on dedicated clusters provisioned for peak load to ensure responsiveness and tolerate data center outages. As a result, the average load is far lower than the peak load used for provision ...

USENIX ASSOC2018

Extracting And Aligning Artist Names in Digitized Art Historical Archives

Frédéric Kaplan, Benoît Laurent Auguste Seguin, Isabella Di Lenardo

The largest collections of art historical images are not found online but are safeguarded by museums and other cultural institutions in photographic libraries. These collections can encompass millions of reproductions of paintings, drawings, engravings and ...

Red de Humanidades Digitales A. C.2018

The Economics of Sharing Markets

Maryam Razeghian Jahromi

Sharing and redistributing assets between individuals has become a noticeable part of the economy. Ownership is no longer the sole mode of consumption and consumers have the option of choosing between ownership and access-based consumption. This change in ...

EPFL2017

Tracking Transmission of Details in Paintings

Frédéric Kaplan, Benoît Laurent Auguste Seguin, Isabella Di Lenardo

In previous articles (di Lenardo et al, 2016; Seguin et al, 2016), we explored how efficient visual search engines operating not on the basis of textual metadata but directly through visual queries, could fundamen- tally change the navigation in large data ...

2017

Adaptive relevance feedback for large-scale image retrieval

François Fleuret, Nicolae Suditu

Content-based image retrieval aims at substituting traditional indexing based on manual annotation by using automatically-extracted visual indexing features. Novel techniques are needed however to efficiently deal with the semantic gap (i.e. the partial ma ...

2016

PriFi: A Low-Latency and Tracking-Resistant Protocol for Local-Area Anonymous Communication

Jean-Pierre Hubaux, Ludovic Barman, Italo Ivan Dacosta Petrocelli, Bryan Alexander Ford, Mahdi Zamani

Popular anonymity mechanisms such as Tor provide low communication latency but are vulnerable to traffic analysis attacks that can de-anonymize users. Moreover, known traffic-analysis-resistant techniques such as Dissent are impractical for use in latency- ...

ACM2016

Contextualized ranking of entity types based on knowledge graphs

Philippe Cudré-Mauroux, Karl Aberer, Michele Catasta, Roman Prokofyev

A large fraction of online queries targets entities. For this reason, Search Engine Result Pages (SERPs) increasingly contain information about the searched entities such as pictures, short summaries, related entities, and factual information. A key facet ...

Elsevier Science Bv2016

Squall: Scalable Real-time Analytics

Aleksandar Vitorovic, Christoph Koch, Mohamed Elsayed Mohamed Ahmed El Seidy, Ioannis Klonatos, Mohammad Dashti Rahmat Abadi, Daniel Espino Timón, Minh Khue Vu, Khayyam Mubariz Oglu Guliyev

Squall is a scalable online query engine that runs complex analytics in a cluster using skew-resilient, adaptive operators. Squall builds on state-of-the-art partitioning schemes and local algorithms, including some of our own. This paper presents the over ...

VLDB Endowment Inc.2016