Publication

Beyond term indexing: A P2P framework for Web information retrieval

Related publications (32)

Altruism, reciprocity, and tokens to reward forwarding data: Is that fair?

Verónica del Carmen Estrada Galiñanes, Arman Babaei

Decentralized storage networks offer services with intriguing possibilities to reduce inequalities in an extremely centralized market. Fair distribution of rewards, however, is still a persistent problem in the current generation of decentralized applicati ...
2024

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

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

Knowledge-Aware Cross-Modal Text-Image Retrieval for Remote Sensing Images

Devis Tuia, Christel Marie Tartini-Chappuis, Li Mi, Siran Li

Image-based retrieval in large Earth observation archives is difficult, because one needs to navigate across thousands of candidate matches only with the proposition image as a guide. By using text as a query language, the retrieval system gains in usabili ...
2022

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

Moby: A Blackout-Resistant Anonymity Network for Mobile Devices

Bryan Alexander Ford, Antoine Rault, Amogh Pradeep, Hira Javaid

Internet blackouts are challenging environments for anonymity and censorship resistance. Existing popular anonymity networks (e.g., Freenet, I2P, Tor) rely on Internet connectivity to function, making them impracticable during such blackouts. In such a set ...
2022

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 ...
INFORMS2022

QAIR: Practical Query-efficient Black-Box Attacks for Image Retrieval

Shaokai Ye, Yuan He, Hang Su, Jinfeng Li

We study the query-based attack against image retrieval to evaluate its robustness against adversarial examples under the black-box setting, where the adversary only has query access to the top-1 ranked unlabeled images from the database. Compared with que ...
IEEE COMPUTER SOC2021

Semantics-Aware Spatial-Temporal Binaries for Cross-Modal Video Retrieval

Jie Luo, Yiyu Wang, Mengshi Qi

With the current exponential growth of video-based social networks, video retrieval using natural language is receiving ever-increasing attention. Most existing approaches tackle this task by extracting individual frame-level spatial features to represent ...
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2021

An Improved Analysis of Local Search for Max-Sum Diversification

Friedrich Eisenbrand, Rico Zenklusen, 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

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.