Publications associées à Web profond

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

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

Capturing the Moment: Lightweight Similarity Computations

Rachid Guerraoui, Rhicheek Patra, Georgios Damaskinos

Similarity computations are crucial in various web activities like advertisements, search or trust-distrust predictions. These similarities often vary with time as product perception and popularity constantly change with users' evolving inclination. The hu ...

IEEE2017

Towards Near-Threshold Server Processors

David Atienza Alonso, Babak Falsafi, Marina Zapater Sancho, Luca Benini, Ali Pahlevan, Pablo Garcia del Valle, Javier Picorel Obando, 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

PACCMIT/PACCMIT-CDS: identifying microRNA targets in 3′ UTRs and coding sequences

Jiri Vanicek, Ray Marcel Marin Florez, Miroslav Sulc

The purpose of the proposed web server, publicly available at http://paccmit.epfl.ch, is to provide a user-friendly interface to two algorithms for predicting messenger RNA (mRNA) molecules regulated by microRNAs: (i) PACCMIT (Prediction of ACcessible and/ ...

Oxford University Press2015

Towards a highly effective and robust Web credibility evaluation system

Karl Aberer, Xin Liu

By leveraging crowdsourcing, Web credibility evaluation systems (WCESs) have become a promising tool to assess the credibility of Web content, e.g., Web pages. However, existing systems adopt a passive Way to collect users' credibility ratings, which incur ...

Elsevier Science Bv2015

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

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.

Web profond

An Improved Analysis of Local Search for Max-Sum Diversification

PerfIso: Performance Isolation for Commercial Latency-Sensitive Services

PerfIso: Performance Isolation for Commercial Latency-Sensitive Services

Capturing the Moment: Lightweight Similarity Computations

Towards Near-Threshold Server Processors

Heracles: Improving Resource Efficiency at Scale

PACCMIT/PACCMIT-CDS: identifying microRNA targets in 3′ UTRs and coding sequences

Towards a highly effective and robust Web credibility evaluation system

Scalable Collaborative Bayesian Preference Learning

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

Graph Chatbot

Chattez avec Graph Search

PerfIso: Performance Isolation for Commercial Latency-Sensitive Services

PerfIso: Performance Isolation for Commercial Latency-Sensitive Services

An Improved Analysis of Local Search for Max-Sum Diversification

Heracles: Improving Resource Efficiency at Scale

PACCMIT/PACCMIT-CDS: identifying microRNA targets in 3′ UTRs and coding sequences

Towards a highly effective and robust Web credibility evaluation system

Capturing the Moment: Lightweight Similarity Computations

Scalable Collaborative Bayesian Preference Learning

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

Towards Near-Threshold Server Processors