Survivable Routing of Mesh Topologies in IP-over-WDM Networks by Recursive Graph Contraction

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.

Decentralized signal control of congested traffic networks based on the Max-Pressure (MP) controller is theoretically proven to maximize throughput, stabilize the system and balance queues for single intersections under specific conditions. However, its pe ...

Disclosed herein is a method for labelling a portion of a device, said method comprising the steps of providing a first substrate layer of a transparent or translucent material, depositing a first coloured material onto said first substrate layer in a labe ...

Spinal cord injury (SCI) interrupts axonal connections between the brain and the spinal cord, and is characterized by a spectrum of sensorimotor and autonomic impairments. While spontaneous recovery is limited, recent studies have shown that functional imp ...

We consider fundamental algorithmic number theoretic problems and their relation to a class of block structured Integer Linear Programs (ILPs) called 2-stage stochastic. A 2-stage stochastic ILP is an integer program of the form min{c(T)x vertical bar Ax = ...

Collective Remote Attestation (CRA) is a well-established approach where a single Verifier attests the integrity of multiple devices in a single execution of the challenge-response protocol. Current CRA solutions are well-suited for Internet of Things (IoT ...

A motif is a frequently occurring subgraph of a given directed or undirected graph G (Milo et al.). Motifs capture higher order organizational structure of G beyond edge relationships, and, therefore, have found wide applications such as in graph clusterin ...

A composite multi-layer textile (1), comprising at least one nanofibre layer (11) with nanofibres with diameters below 100nm and one support layer (12) with microfibres with diameters below three microns, wherein the layers (11, 12) were produced by electr ...

The convergence speed of machine learning models trained with Federated Learning is significantly affected by non-independent and identically distributed (non-IID) data partitions, even more so in a fully decentralized setting without a central server. In ...

The required module capacitances of modular multilevel converters can be significantly reduced in comparison to conventional operation modes when quasi-two-level operation is applied. Unfortunately, the output voltage distortion becomes similar to those of ...

We study how permutation symmetries in overparameterized multi-layer neural networks generate `symmetry-induced' critical points. Assuming a network with

L

layers of minimal widths

r_1^*, \ldots, r_{L-1}^*

reaches a zero-loss minimum at $ r_1^*! \c ...

Pearl's do calculus is a complete axiomatic approach to learn the identifiable causal effects from observational data. When such an effect is not identifiable, it is necessary to perform a collection of often costly interventions in the system to learn the ...

This article addresses the problem of simultaneous distributed state estimation, and control of linear systems with linear state feedback, subjected to process, and measurement noise, under the constraints of quantized, and rate-limited network data transm ...

Online services have become ubiquitous in technological society, the global demand for which has driven enterprises to construct gigantic datacenters that run their software. Such facilities have also recently become a substrate for third-party organizatio ...

Graph learning is often a necessary step in processing or representing structured data, when the underlying graph is not given explicitly. Graph learning is generally performed centrally with a full knowledge of the graph signals, namely the data that live ...

We develop random graph models where graphs are generated by connecting not only pairs of vertices by edges, but also larger subsets of vertices by copies of small atomic subgraphs of arbitrary topology. This allows for the generation of graphs with extens ...

We study the computations that Bayesian agents undertake when exchanging opinions over a network. The agents act repeatedly on their private information and take myopic actions that maximize their expected utility according to a fully rational posterior be ...

LoRaWAN is nowadays one of the most popular protocols for low-power Internet of Things communications. Although its physical layer, namely LoRa, has been thoroughly studied in the literature, aspects related to the synchronization of LoRa receivers have re ...

Traffic congestion constitutes one of the most frequent, yet challenging, problems to address in the urban space. Caused by the concentration of population, whose mobility needs surpass the serving capacity of urban networks, congestion cannot be resolved ...

We show that Cutting Planes (CP) proofs are hard to find: Given an unsatisfiable formula F, It is -hard to find a CP refutation of F in time polynomial in the length of the shortest such refutation; and unless Gap-Hitting-Set admits a nontrivial algorithm, ...

Survivable Routing of Mesh Topologies in IP-over-WDM Networks by Recursive Graph Contraction

Chat with Graph Search

Critical node selection method for efficient Max-Pressure traffic signal control in large-scale congested networks

Method for labelling a device and devices obtanaible therefrom

Targeted regeneration of spinal cord neurons across a complete injury restores walking

The double exponential runtime is tight for 2-stage stochastic ILPs

HolA: Holistic and Autonomous Attestation for IoT Networks

Motif Cut Sparsifiers

Transparent composite nano-fibre based multi-layer textile

D-Cliques: Compensating for Data Heterogeneity with Topology in Decentralized Federated Learning

A Modular Multilevel Converter with a Clamping Switch for Quasi-Three-Level Operation

Geometry of the Loss Landscape in Overparameterized Neural Networks: Symmetries and Invariances

Minimum Cost Intervention Design for Causal Effect Identification

A Distributed Luenberger Observer for Linear State Feedback Systems With Quantized and Rate-Limited Communications

Hardware and Software Support for RPC-Centric Server Architecture

Distributed Graph Learning With Smooth Data Priors

Atomic subgraphs and the statistical mechanics of networks

Bayesian Decision Making in Groups is Hard

A Low-Complexity LoRa Synchronization Algorithm Robust to Sampling Time Offsets

Large-scale traffic signal control and multimodal network design

Automating cutting planes is NP-hard