Cluster-and-Conquer: When Randomness Meets Graph Locality

À propos
Confidentialité
Mentions légales

Graph Chatbot

Publications associées (28)

Cognitive workload monitoring in virtual reality based rescue missions with drones

David Atienza Alonso, Fabio Isidoro Tiberio Dell'Agnola, Adriana Arza Valdes, Niloofar Momeni

The use of drones in search and rescue (SAR) missions can be very cognitively demanding. Since high levels of cognitive workload can negatively affect human performance, there is a risk of compromising the mission and leading to failure with catastrophic o ...

2020

Symbolic Algorithms for Token Swapping

Giovanni De Micheli, Mathias Soeken, Bruno Schmitt Antunes

We study different symbolic algorithms to solve two related reconfiguration problems on graphs: the token swapping problem and the permutation routing via matchings problem. Input to both problems is a connected graph with labeled vertices and a token in e ...

2020

New Results in Integer and Lattice Programming

Christoph Hunkenschröder

An integer program (IP) is a problem of the form

\min \{f(x) : \, Ax = b, \ l \leq x \leq u, \ x \in \Z^n\}

, where

A \in \Z^{m \times n}

b \in \Z^m

l,u \in \Z^n

, and

f: \Z^n \rightarrow \Z

is a separable convex objective function. The problem o ...

EPFL2020

Robust Distributed Learning

El Mahdi El Mhamdi

Whether it occurs in artificial or biological substrates, {\it learning} is a {distributed} phenomenon in at least two aspects. First, meaningful data and experiences are rarely found in one location, hence {\it learners} have a strong incentive to work t ...

EPFL2020

Estimation of discrete choice models with hybrid stochastic adaptive batch size algorithms

Michel Bierlaire, Gael Lederrey, Virginie Janine Camille Lurkin, Timothy Michael Hillel

The emergence of Big Data has enabled new research perspectives in the discrete choice community. While the techniques to estimate Machine Learning models on a massive amount of data are well established, these have not yet been fully explored for the esti ...

2021

Graph Signal Processing for Machine Learning: A Review and New Perspectives

Pascal Frossard, Ntorina Thanou, Xiaowen Dong, Laura Toni, Michael Bronstein

The effective representation, processing, analysis, and visualization of large-scale structured data, especially those related to complex domains, such as networks and graphs, are one of the key questions in modern machine learning. Graph signal processing ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2020

New Graph Algorithms via Polyhedral Techniques

Jakub Tarnawski

In this thesis we give new algorithms for two fundamental graph problems. We develop novel ways of using linear programming formulations, even exponential-sized ones, to extract structure from problem instances and to guide algorithms in making progress. S ...

EPFL2019

Fingerprinting Big Data: The Case of KNN Graph Construction

Rachid Guerraoui, Anne-Marie Kermarrec, Olivier Ruas

We propose fingerprinting, a new technique that consists in constructing compact, fast-to-compute and privacy-preserving binary representations of datasets. We illustrate the effectiveness of our approach on the emblematic big data problem of K-Nearest-Nei ...

2019

Page 2 sur 2