Related publications (123)

Tag Recommendation for Large-Scale Ontology-Based Information Systems

Karl Aberer, Alexey Boyarsky, Oleg Ruchayskiy, Philippe Cudré-Mauroux, Roman Prokofyev

We tackle the problem of improving the relevance of automatically selected tags in large-scale ontology-based information systems. Contrary to traditional settings where tags can be chosen arbitrarily, we focus on the problem of recommending tags (e.g., co ...
Springer2012

Compressive sensing meets game theory

Volkan Cevher, Sina Jafarpour

We introduce the Multiplicative Update Selector and Estimator (MUSE) algorithm for sparse approximation in under-determined linear regression problems. Given ƒ = Φα* + μ, the MUSE provably and efficiently finds a k-sparse vector α̂ such that ∥Φα̂ − ƒ∥∞ ≤ ∥ ...
IEEE2011

A Probabilistic Approach to Socio-Geographic Reality Mining

Katayoun Farrahi

As we live our daily lives, our surroundings know about it. Our surroundings consist of people, but also our electronic devices. Our mobile phones, for example, continuously sense our movements and interactions. This socio-geographic data could be continuo ...
EPFL2011

Integration of Eye-tracking Methods in Visual Comfort Assessments

Marilyne Andersen, Mandana Sarey Khanie

Discomfort glare, among different aspects of visual discomfort is a phenomenon which is little understood and hard to quantify. As this phenomenon is dependent on the building occupant’s view direction and on the relative position of the glare source, a de ...
2011

Scalar and pseudoscalar Higgs production in association with a top-antitop pair

Valentin Hirschi

We present the calculation of scalar and pseudoscalar Higgs production in association with a top-antitop pair to the next-to-leading order (NLO) accuracy in QCD, interfaced with parton showers according to the MC@NLO formalism. We apply our results to the ...
2011

Learning in Gaussian Markov random fields

Thomas Riedl

This paper addresses the problem of state estimation in the case where the prior distribution of the states is not perfectly known but instead is parameterized by some unknown parameter. Thus in order to support the state estimator with prior information o ...
2010

Tight Bounds on the Capacity of Binary Input random CDMA Systems

Nicolas Macris, Satish Babu Korada

We consider multiple access communication on a binary input additive white Gaussian noise channel using randomly spread code division. For a general class of symmetric distributions for spreading coefficients, in the limit of a large number of users, we pr ...
2010

Phase behaviour of the symmetric binary mixture from Thermodynamic Perturbation Theory

Nicolas Dorsaz, Giuseppe Foffi

We study the phase behaviour of symmetric binary mixtures of hard core Yukawa (HCY) particles via thermodynamic perturbation theory (TPT). We show that all the topologies of phase diagram reported for the symmetric binary mixtures are correctly reproduced ...
2010

Distinguishing Distributions Using Chernoff Information

Serge Vaudenay, Pouyan Sepehrdad, Thomas Baignères

In this paper, we study the soundness amplification by repetition of cryptographic protocols. As a tool, we use the Chernoff Information. We specify the number of attempts or samples required to distinguish two distributions efficiently in various protocol ...
Springer2010

An indirect assessment on the impact of connectivity of conductivity classes upon longitudinal asymptotic macrodispersivity

Samir Suweis

Solute transport takes place in heterogeneous porous formations, with the log conductivity, Y = ln K, modeled as a stationary random space function of given univariate normal probability density function (pdf) with mean Y, variance σY2, and integral scale ...
American Geophysical Union2010

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.