Publication

Association Generation in Synthetic Population for Transportation Applications: Graph-Theoretic Solution

Publications associées (26)

Housing, street and health: a new systemic research framework

Paola Viganò, Stéphane Joost, Dusan Licina, Anna Pagani, Valentin Daniel Maurice Bourdon, Mathias Lerch, Catarina Wall Gago, Derek Pierre Christie, Idris Guessous

As the world’s population grows in cities, urban dwellers spend a large amount of time inside their home, making housing health ever more important. Critical for residents’ health, the interactions between indoor residential environments and outdoor enviro ...

2023

Generalizing Bulk-Synchronous Parallel Processing for Data Science: From Data to Threads and Agent-Based Simulations

Christoph Koch, Zilu Tian, Val Tannen, Peter Lindner

We generalize the bulk-synchronous parallel (BSP) processing model to make it better support agent-based simulations. Such simulations frequently exhibit hierarchical structure in their communication patterns which can be exploited to improve performance. ...

2023

Generalizing Bulk-Synchronous Parallel Processing for Data Science: From Data to Threads and Agent-Based Simulations

Zilu Tian

Agent-based simulations have been widely applied in many disciplines, by scientists and engineers alike. Scientists use agent-based simulations to tackle global problems, including alleviating poverty, reducing violence, and predicting the impact of pandem ...

EPFL2023

A subcellular biochemical model for T6SS dynamics reveals winning competitive strategies

Yuexia Luna Lin

The type VI secretion system (T6SS) is a broadly distributed interbacterial weapon that can be used to eliminate competing bacterial populations. Although unarmed target populations are typically used to study T6SS function in vitro, bacteria most likely e ...

OXFORD UNIV PRESS2023

Multi-agent Learning with Privacy Guarantees

Elsa Rizk

A multi-agent system consists of a collection of decision-making or learning agents subjected to streaming observations from some real-world phenomenon. The goal of the system is to solve some global learning or optimization problem in a distributed or dec ...

EPFL2023

Real-time Personalized Monitoring of Neurological Disorders on Wearable Systems

Renato Zanetti

The terminology of neurological disorders encompasses a range of serious illnesses (e.g., epilepsy, Alzheimer's disease) leading to morbidity, disability, and stigma. Epilepsy alone affects over 50 million people worldwide, and these figures are rising as ...

EPFL2023

SPECTRE: Spectral Conditioning Helps to Overcome the Expressivity Limits of One-shot Graph Generators

Nathanaël Perraudin, Andreas Loukas, Karolis Martinkus

We approach the graph generation problem from a spectral perspective by first generating the dominant parts of the graph Laplacian spectrum and then building a graph matching these eigenvalues and eigenvectors. Spectral conditioning allows for direct model ...

JMLR-JOURNAL MACHINE LEARNING RESEARCH2022

Streaming and Matching Problems with Submodular Functions

Paritosh Garg

Submodular functions are a widely studied topic in theoretical computer science. They have found several applications both theoretical and practical in the fields of economics, combinatorial optimization and machine learning. More recently, there have also ...

EPFL2022

Random walks and forbidden minors III: poly(d epsilon(-1))-time partition oracles for minor-free graph classes

Akash Kumar

Consider the family of bounded degree graphs in any minor-closed family (such as planar graphs). Let d be the degree bound and n be the number of vertices of such a graph. Graphs in these classes have hyperfinite decompositions, where, one removes a small ...

IEEE COMPUTER SOC2022

Tight Vector Bin Packing with Few Small Items via Fast Exact Matching in Multigraphs

Adam Teodor Polak, Alexandra Anna Lassota

We solve the Bin Packing problem in O^*(2^k) time, where k is the number of items less or equal to one third of the bin capacity. This parameter measures the distance from the polynomially solvable case of only large (i.e., greater than one third) items. O ...

Schloss Dagstuhl – Leibniz-Zentrum fur Informatik2022