A method of calculating path observation likelihood from GPS data
Related publications (37)
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.
We investigate the problem of collaborative video streaming with Raptor network coding over overlay networks. We exploit path and source diversity, as well as basic processing capabilities of network nodes to increase the overall throughput and improve the ...
We consider multisource non-coherent network coding, where multiple sources send information to one or multiple receivers. We prove that this is equivalent to a ldquosubspacerdquo channel, that takes subspaces as inputs and outputs. We then show that the r ...
Providing real-time multimedia services over a best-effort network is challenging due to the stringent delay requirements in the presence of complex network dynamics. Multiple description (MD) coding is one approach to transmit the media over diverse (mult ...
In many wired and wireless networks, nodes process input traffic to satisfy a network constraint (e.g., a capacity constraint) and to increase the utility of data in the output flows given these constraints. In this paper we focus on the special case in wh ...
We study adaptive route choice models that explicitly capture travelers' route choice adjustments according to information on realized network conditions in stochastic time-dependent networks. Two types of adaptive route choice models are explored: an adap ...
We consider the problem of correlated data gathering by a network with a sink node and a tree based communication structure, where the goal is to minimize the total trans- mission cost of transporting the information collected by the nodes, to the sink nod ...
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 paper, a new ...
Virtual private network design is the following NP-hard problem. We are given a communication network, represented as a weighted graph with thresholds on the nodes which represent the amount of flow that a node can send to and receive from the network. The ...
Route choice models are difficult to design and to estimate for various reasons. In this paper we focus on issues related to data. Indeed, real data in its original format are not related to the network used by the modeler and do therefore not correspond t ...
Route choice models are difficult to design and to estimate for various reasons. In this paper we focus on issues related to data. Indeed, real data in its original format are not related to the network used by the modeler and do therefore not correspond t ...