Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Concept

Robot d'indexation

Publications associées (19)

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

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

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

MoleculARweb: A Web Site for Chemistry and Structural Biology Education through Interactive Augmented Reality out of the Box in Commodity Devices

Matteo Dal Peraro, Luciano Andres Abriata, Lucien Fabrice Krapp, Fabio Jose Cortes Rodriguez

Augmented/virtual realities (ARs/VRs) promise to revolutionize STEM education. However, most easy-to-use tools are limited to static visualizations, which limits the approachable content, whereas more interactive and dynamic alternatives require costly har ...

AMER CHEMICAL SOC2021

An Improved Analysis of Local Search for Max-Sum Diversification

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

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

USENIX ASSOC2018

Tracking Transmission of Details in Paintings

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

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

Using Linked Open Data to Bootstrap a Knowledge Base of Classical Texts

Matteo Romanello

We describe a domain-specific knowledge base aimed at supporting the extraction of bibliographic references in the domain of Classics. In particular, we deal with references to canonical works of the Greek and Latin literature by providing a model that rep ...

CEUR2017

Towards Near-Threshold Server Processors

David Atienza Alonso, Luca Benini, Babak Falsafi, Marina Zapater Sancho, Pablo Garcia del Valle, Javier Picorel Obando, Ali Pahlevan, Arash Pourhabibi Zarandi

The popularity of cloud computing has led to a dramatic increase in the number of data centers in the world. The ever-increasing computational demands along with the slowdown in technology scaling has ushered an era of power-limited servers. Techniques suc ...

IEEE/ACM2016

Approximation algorithms for geometric dispersion

Alfonso Bolívar Cevallos Manzano

The most basic form of the max-sum dispersion problem (MSD) is as follows: given n points in R^q and an integer k, select a set of k points such that the sum of the pairwise distances within the set is maximal. This is a prominent diversity problem, with w ...

EPFL2016

A Reconfigurable Fabric For Accelerating Large-Scale Datacenter Services

James Richard Larus

To advance datacenter capabilities beyond what commodity server designs can provide, the authors designed and built a composable, reconfigurable fabric to accelerate large-scale software services. They deployed the reconfigurable fabric in a bed of 1,632 s ...

Ieee Computer Soc2015

Scalable Collaborative Bayesian Preference Learning

Matthias Seeger, Mohammad Emtiyaz Khan, Young Jun Ko

Learning about users’ utilities from preference, discrete choice or implicit feedback data is of integral importance in e-commerce, targeted advertising and web search. Due to the sparsity and diffuse nature of data, Bayesian approaches hold much promise, ...

2014

B-hist: Entity-centric search over personal web browsing history

Karl Aberer, Philippe Cudré-Mauroux, Michele Catasta, Jean-Eudes Marie Ranvier

Web Search is increasingly entity centric; as a large fraction of common queries target specific entities, search results get progressively augmented with semi-structured and multimedia information about those entities. However, search over personal web br ...

Elsevier2014

Correlation-Aware Virtual Machine Allocation for Energy-Efficient Datacenters

David Atienza Alonso, Martino Ruggiero, Jungsoo Kim

Server consolidation plays a key role to mitigate the continuous power increase of datacenters. The recent advent of scale-out applications (e.g., web search, MapReduce, etc.) necessitate the revisit of existing server consolidation solutions due to distin ...

ACM and IEEE Press2013

Scale-Out Processors

Pejman Lotfi Kamran

Global-scale online services, such as Google’s Web search and Facebook’s social networking, run in large-scale datacenters. Due to their massive scale, these services are designed to scale out (or distribute) their respective loads and datasets across thou ...

EPFL2013

UCNEbase – a database of ultra-conserved non-coding elements and genomic regulatory blocks

Philipp Bucher, Slavica Dimitrieva Janeva

UCNEbase (http://ccg.vital-it.ch/UCNEbase) is a free, web-accessible information resource on the evolution and genomic organization of ultra-conserved non-coding elements (UCNEs). It currently covers 4351 such elements in 18 different species. The majority ...

Oxford University Press2013

Monitoring network structure and content quality of signal processing articles on wikipedia

Jayakrishnan Unnikrishnan, Tao-Chun Lee

Wikipedia has become a widely-used resource on signal processing. However, the freelance-editing model of Wikipedia makes it challenging to maintain a high content quality. We develop techniques to monitor the network structure and content quality of Signa ...

2013

MARKDOWN

Nicolas Borboën

Français: Markdown est un langage de balisage léger qui permet d’écrire simplement du texte et de le convertir en code HTML pour sa publication sur un site web. Facile à lire, facile à écrire. English: Markdown is a small markup language that allows you to ...

2013