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.
Data is pervasive in today's world and has actually been for quite some time. With the increasing volume of data to process, there is a need for faster and at least as accurate techniques than what we already have. In particular, the last decade recorded t ...
Traffic congestion is a significant issue in all urban areas with concentration of activities for various city topologies and distribution of population and land use around the world. Developing realistic models that are able to replicate congestion spread ...
We study the problem of constructing epsilon-coresets for the (k, z)-clustering problem in a doubling metric M(X, d). An epsilon-coreset is a weighted subset S subset of X with weight function w : S -> R->= 0, such that for any k-subset C is an element of ...
The problem of clustering in urban traffic networks has been mainly studied in static framework by considering traffic conditions at a given time. Nevertheless, it is important to underline that traffic is a strongly time-variant process and it needs to be ...
We introduce the Fixed Cluster Repair System (FCRS) as a novel architecture for Distributed Storage Systems (DSS) that achieves a small repair bandwidth while guaranteeing a high availability. Specifically, we partition the set of servers in a DSS into s c ...
2018
,
We consider the problem of decentralized clustering and estimation over multitask networks, where agents infer and track different models of interest. The agents do not know beforehand which model is generating their own data. They also do not know which a ...
In this work, we consider the problem of estimating the coefficients of linear shift-invariant FIR graph filters. We assume hybrid node-varying graph filters where the network is decomposed into clusters of nodes and, within each cluster, all nodes have th ...
The problem of clustering in urban traffic networks has been mainly studied in static framework by only considering traffic conditions at a given time. Nevertheless, it is important to underline here that traffic is a strongly time-variant process and it n ...
Background: Obesity and obesity-related diseases represent a major public health concern. Recently, studies have substantiated the role of sugar-sweetened beverages (SSBs) consumption in the development of these diseases.The fine identification of populati ...
Springer2019
, ,
Despite the importance of understanding the historical dynamics of ecosystem services (ES), littleresearch has focused on a historical, spatially explicit, assessment of ES supply. This research is aimed at understanding the spatial patterns and potential ...