Concept

Search engine optimization

Related publications (129)

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

Precision Global Health - The case of Ebola: a scoping review

Gérard Escher

Background The 2014-2016 Ebola outbreak across West Africa was devastating, acting not only as a wake-up call for the global health community, but also as a catalyst for innovative change and global action. Improved infectious disease monitoring is the ste ...

2019

Language Independent Query by Example Spoken Term Detection

Dhananjay Ram

Language independent query-by-example spoken term detection (QbE-STD) is the problem of retrieving audio documents from an archive, which contain a spoken query provided by a user. This is usually casted as a hypothesis testing and pattern matching problem ...

EPFL2019

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

Jiyong Zhang, Yue Wang, Hongyu Yang

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

Web Content Credibility

This book introduces readers to Web content credibility evaluation and evaluation support. It highlights empirical research and establishes a solid foundation for future research by presenting methods of supporting credibility evaluation of online content, ...

Springer2018

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

Making large art historical photo archives searchable

Benoît Laurent Auguste Seguin

In recent years, museums, archives and other cultural institutions have initiated important programs to digitize their collections. Millions of artefacts (paintings, engravings, drawings, ancient photographs) are now represented in digital photographic for ...

EPFL2018

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

Enhancing model-based feedback perimeter control with data-driven online adaptive optimization

Nikolaos Geroliminis, Anastasios Kouvelas, Mohammadreza Saeedmanesh

Most feedback perimeter control approaches that are based on the Macroscopic Fundamental Diagram (MFD) and are tested in detailed network structures restrict inflow from the external boundary of the network. Although such a measure is beneficial for the ne ...

2017

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.