Concept

Algorithme probabiliste

Publications associées (758)

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

Spatial joins in main memory: implementation matters!

Darius Sidlauskas

A recent PVLDB paper reports on experimental analyses of ten spatial join techniques in main memory. We build on this comprehensive study to raise awareness of the fact that empirical running time performance findings in main-memory settings are results of ...

2014

Centrality of Trees for Capacitated k-Center

Ola Nils Anders Svensson, Hyung Chan An, Aditya Bhaskara

We consider the capacitated k-center problem. In this problem we are given a finite set of locations in a metric space and each location has an associated non-negative integer capacity. The goal is to choose (open) k locations (called centers) and assign e ...

Springer2014

Sensing the real world

Juri Ranieri

A sensor is a device that detects or measures a physical property and records, indicates, or otherwise responds to it. In other words, a sensor allows us to interact with the surrounding environment, by measuring qualitatively or quantitatively a given phe ...

EPFL2014

Near-Optimal Source Placement for Linear Physical Fields

Martin Vetterli, Juri Ranieri

In real-word applications, signal processing is often used to measure and control a physical field by means of sensors and sources, respectively. An aspect that has been often neglected is the optimization of the sources' locations. In this work, we discus ...

Ieee2014

Stochastic Virtual Tests for High-Temperature Ceramic Matrix Composites

Varun Parameswaran Rajan

We review the development of virtual tests for high-temperature ceramic matrix composites with textile reinforcement. Success hinges on understanding the relationship between the microstructure of continuous-fiber composites, including its stochastic varia ...

2014

BF-Tree: Approximate Tree Indexing

Anastasia Ailamaki, Manoussos Gavriil Athanassoulis

The increasing volume of time-based generated data and the shift in storage technologies suggest that we might need to reconsider indexing. Several workloads - like social and service monitoring - often include attributes with implicit clustering because o ...

2014

Opaque Sets

János Pach

The problem of finding "small" sets that meet every straight-line which intersects a given convex region was initiated by Mazurkiewicz in 1916. We call such a set an opaque set or a barrier for that region. We consider the problem of computing the shortest ...

Springer2014

Complexity Certification of the Fast Alternating Minimization Algorithm for Linear Model Predictive Control

Colin Neil Jones, Ye Pu, Melanie Nicole Zeilinger

In this paper, the fast alternating minimization algorithm (FAMA) is proposed to solve model predictive control (MPC) problems with polytopic and second-order cone constraints. We extend previous theoretical results of FAMA to a more general case, where co ...

2014

Probabilistic partitioning methods to find significant patterns in ChIP-Seq data

Bernard Moret, Philipp Bucher, Nishanth Ulhas Nair, Sunil Kumar

Motivation: We have witnessed an enormous increase in ChIP-Seq data for histone modifications in the past few years. Discovering significant patterns in these data is an important problem for understanding biological mechanisms. Results: We propose probabi ...

Oxford University Press2014

Matrix Recipes for Hard Thresholding Methods

Volkan Cevher, Anastasios Kyrillidis

In this paper, we present and analyze a new set of low-rank recovery algorithms for linear inverse problems within the class of hard thresholding methods. We provide strategies on how to set up these algorithms via basic ingredients for different configura ...

Springer Verlag2014