Dynamic clustering and propagation of congestion in heterogeneously congested urban traffic networks
Related publications (113)
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.
In this paper, a new framework to discover places-of-interest from multimodal mobile phone data is presented. Mobile phones have been used as sensors to obtain location information from users’ real lives. A place-of-interest is defined as a location where ...
The concept of the Macroscopic Fundamental Diagram (MFD) is elegant and attractive because it provides a global view of traffic behavior and performance at a network level. However, recent research shows that the MFD shape can be influenced by local traffi ...
Relationships between entities in datasets are often of multiple types, which can naturally be modeled by a multi-layer graph; a common vertex set represents the entities and the edges on different layers capture different types of relationships between th ...
Distributed processing over networks relies on in-network processing and cooperation among neighboring agents. Cooperation is beneficial when all agents share the same objective or belong to the same group. However, if agents belong to different clusters o ...
After a major flood catastrophe, a precious information is the delineation of the affected areas. Remote sensing imagery, especially synthetic aperture radar, allows to obtain a global and complete view of the situation. However, the detection of the flood ...
Networked computing environments are subject to configuration errors, unauthorized users, undesired activities and attacks by malicious software. These can be detected by monitoring network traffic, but network administrators are overwhelmed by the amount ...
We introduce a simple and general approach to the problem of clustering structures from atomic trajectories of chemical reactions in solution. By considering distance metrics which are invariant under permutation of identical atoms or molecules, we demonst ...
It has been recently shown that a macroscopic fundamental diagram (MFD) linking space-mean network flow, density and speed exists in the urban transportation networks under some conditions. An MFD is further well defined if the network is homogeneous with ...
Monitoring traffic events in computer network has become a critical task for operators to maintain an accurate view of a network's condition, to detect emerging security threats, and to safeguard the availability of resources. Conditions detrimental to a n ...
The R package bclust is useful for clustering high-dimensional continuous data. The package uses a parametric spike-and-slab Bayesian model to downweight the effect of noise variables and to quantify the importance of each variable in agglomerative cluster ...