Publication

A Distributed Polling with Probabilistic Privacy

Publications associées (67)

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

GENERATING PROBABILISTIC PATH OBSERVATION FROM GPS DATA FOR ROUTE CHOICE MODELING

Michel Bierlaire, Jingmin Chen, Jeffrey Newman

Abstract: Map matching algorithms are the conventional way to generate path observations from GPS data for route choice models. The deterministic matching may introduce extra biases to parameters of route choice models if the matching is wrong. In this pap ...

2009

A comparative analysis of implicit and explicit methods to model choice set generation

Michel Bierlaire, Gunnar Flötteröd, Ricardo Daniel Hurtubia González

In this paper, we compare two methods to model the formation of choice sets in the context of discrete choice models. The first method is the probabilistic approach proposed by Manski (1977), who explicitly models the choice set generation process by expre ...

2009

An integrated adaptive model for overheating risk prediction

Darren Robinson, Frédéric Haldi

Based on the results from a field survey campaign, this article describes three new developments which have been integrated to provide a comprehensive basis for the evaluation of overheating risk in offices. Firstly, a set of logistic regression equations ...

2008

A quasi-dynamic capacity constrained frequency-based transit assignment model

This paper presents a first approach to dynamic frequency-based transit assignment. As such the model aims to close the gap between schedule-based and frequency-based models. Frequency-based approaches have some advantages compared to schedule-based models ...

Elsevier2008

Fountain codes for piecewise stationary channels

Mohammad Amin Shokrollahi, Bertrand Ndzana Ndzana

In this paper, two fixed per-information symbol complexity lossless source coding algorithms are modified for estimation and incremental LT decoding over piecewise stationary memoryless channels (PSMC's) with a bounded number of abrupt changes in channel s ...

IEEE2008

Lifetime of the Cs6P(1/2) state in bcc and hcp solid He-4

Simone Ulzega

We present the first experimental study of time-resolved fluorescence from laser-excited Cs(6P(1/2)) atoms isolated in a solid He-4 matrix. The results are compared to the predictions of the bubble model including the interaction of the atomic dipole with ...

2008

Simple learning rules to cope with changing environments

Roderich Gross

We consider an agent that must choose repeatedly among several actions. Each action has a certain probability of giving the agent an energy reward, and costs may be associated with switching between actions. The agent does not know which action has the hig ...

2008

Equivalence of labeled Markov chains

Laurent Doyen

We consider the equivalence problem for labeled Markov chains (LMCs), where each state is labeled with an observation. Two LMCs are equivalent if every finite sequence of observations has the same probability of occurrence in the two LMCs. We show that equ ...

2008

Reliability of computational science

Fabio Nobile

Today's computers allow us to simulate large, complex physical problems. Many times the mathematical models describing such problems are based on a relatively small amount of available information such as experimental measurements. The question arises whet ...

Wiley-Blackwell2007

A tutorial on (Bayesian) probability

Claudio Mattiussi

The aim of this tutorial is to show that, when properly formulated, probability theory is simply the science of plausible reasoning, which permits us to represent exactly and to update our state of information about the world. This is nothing new, since in ...

2005