Publication
Dynamic clustering and propagation of congestion in heterogeneously congested urban traffic networks
Related publications (113)
Interpret3C: Interpretable Student Clustering Through Individualized Feature Selection
Vinitra Swamy, Paola Mejia Domenzain, Julian Thomas Blackwell, Isadora Alves de Salles
Clustering in education, particularly in large-scale online environments like MOOCs, is essential for understanding and adapting to diverse student needs. However, the effectiveness of clustering depends on its interpretability, which becomes challenging w ...
2024Worst-Case Delay Analysis of Time-Sensitive Networks with Network Calculus
Seyed Mohammadhossein Tabatabaee
Time-sensitive networks, as in the context of IEEE Time-Sensitive Networking (TSN) and IETF Deterministic Networking (DetNet), offer deterministic services with guaranteed bounded latency in order to support safety-critical applications. In this thesis, we ...
EPFL2023Subspace clustering in high-dimensions: Phase transitions & Statistical-to-Computational gap
Florent Gérard Krzakala, Lenka Zdeborová, Luca Pesce, Bruno Loureiro
A simple model to study subspace clustering is the high-dimensional k -Gaussian mixture model where the cluster means are sparse vectors. Here we provide an exact asymptotic characterization of the statistically optimal reconstruction error in this model i ...
2022Single-Trace Clustering Power Analysis of the Point-Swapping Procedure in the Three Point Ladder of Cortex-M4 SIKE
Aymeric Genet, Novak Kaluderovic
In this paper, the recommended implementation of the post-quantum key exchange SIKE for Cortex-M4 is attacked through power analysis with a single trace by clustering with the k-means algorithm the power samples of all the invocations of the elliptic curve ...
Springer, Cham2022Binary Perceptron: Efficient Algorithms Can Find Solutions in a RareWell-Connected Cluster
It was recently shown that almost all solutions in the symmetric binary perceptron are isolated, even at low constraint densities, suggesting that finding typical solutions is hard. In contrast, some algorithms have been shown empirically to succeed in fin ...
ASSOC COMPUTING MACHINERY2022Sublinear Algorithms for Spectral Graph Clustering
This thesis focuses on designing spectral tools for graph clustering in sublinear time. With the emergence of big data, many traditional polynomial time, and even linear time algorithms have become prohibitively expensive. Processing modern datasets requir ...
EPFL2021Size and duration of COVID-19 clusters go along with a high SARS-CoV-2 viral load: A spatio-temporal investigation in Vaud state, Switzerland
Stéphane Joost, Idris Guessous, Séverine Vuilleumier Varisco, Onya Opota, Anaïs Laurence Ladoy
To understand the geographical and temporal spread of SARS-CoV-2 during the first documented wave of infection in the state of Vaud, Switzerland, we analyzed clusters of positive cases using the precise residential location of 33,651 individuals tested (RT ...
2021A multi-hop control scheme for traffic management
We propose a multi-hop control scheme (MHCS) that aims to route traffic through a set of designated intermediate checkpoints (ICs). Because travelers are allowed to freely choose routes for each “hop” that connects real (origin and destination) and ICs, MH ...
2021Evaluating objective measures of impairment to trunk strength and control for cross-country sit skiing
In Paralympic cross-country sit skiing, athlete classification is performed by an expert panel, so it may be affected by subjectivity. An evidence-based classification is required, in which objective measures of impairment must be identified. The purposes ...
SPRINGER LONDON LTD2021Nearly-Tight and Oblivious Algorithms for Explainable Clustering
Ola Nils Anders Svensson, Adam Teodor Polak, Buddhima Ruwanmini Gamlath Gamlath Ralalage, Xinrui Jia
We study the problem of explainable clustering in the setting first formalized by Dasgupta, Frost, Moshkovitz, and Rashtchian (ICML 2020). A k-clustering is said to be explainable if it is given by a decision tree where each internal node splits data point ...
2021