Catégorie

Search engines

Publications associées (135)

Understanding Digital Libraries as Open Spaces

Building on an ongoing case study of how readers navigate the corpus of BnF Gallica and on a nascent project at OpenEdition, I will venture an understanding of digital libraries as open spaces at the crossroads of political spaces—with their governance res ...

2023

Why is the winner the best?

Jian Wang, Gabriel Girard, Ho Ling Li, Adrien Raphaël Depeursinge, Yong Yang, Fan Xia, Xiao Wang, Jing Li, Hui Wang

International benchmarking competitions have become fundamental for the comparative performance assessment of image analysis methods. However, little attention has been given to investigating what can be learnt from these competitions. Do they really gener ...

Los Alamitos2023

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

WEBGRAPH: Capturing Advertising and Tracking Information Flows for Robust Blocking

Carmela González Troncoso, Sandra Deepthy Siby

Users rely on ad and tracker blocking tools to protect their privacy. Unfortunately, existing ad and tracker blocking tools are susceptible to mutable advertising and tracking content. In this paper, we first demonstrate that a state-of-the-art ad and trac ...

USENIX ASSOC2022

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

Countering Bias in Personalized Rankings From Data Engineering to Algorithm Development

Mirko Marras

This tutorial presents recent advances on the assessment and mitigation of data and algorithmic bias in personalized rankings. We first introduce fundamental concepts and definitions associated with bias issues, covering the state of the art and describing ...

IEEE COMPUTER SOC2021

Searching for long-lived particles beyond the Standard Model at the Large Hadron Collider

Yi Zhang, Jia Liu, Jessica Prisciandaro, Federico Leo Redi, Marco Drewes, Marco Trovato, Xiao Wang, Victor Coco, Giorgia Rauco, Ennio Salvioni, Manfredi Ronzani, Patrick Foldenauer, Ahmed Hammad

Particles beyond the Standard Model (SM) can generically have lifetimes that are long compared to SM particles at the weak scale. When produced at experiments such as the Large Hadron Collider (LHC) at CERN, these long-lived particles (LLPs) can decay far ...

IOP PUBLISHING LTD2020

, ,

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

Beyond Keyword Search: Semantic Indexing and Exploration of Large Collections of Historical Newspapers

Maud Ehrmann

For long held on library and archive shelving, historical newspapers are currently undergoing mass digitization and millions of facsimiles, along with their machine-readable content acquired via Optical Character Recognition, are becoming accessible via a ...

2019

Large codebases are routinely indexed by standard Information Retrieval systems, starting from the assumption that code written by humans shows similar statistical properties to written text [Hindle et al., 2012]. While those IR systems are still relativel ...

2019

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search