Recherche

Afficher tous les résultats pour

Accueil

Publication

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

À propos
Confidentialité
Mentions légales

Graph Chatbot

Publications associées (32)

Quantization for Distributed Processing and Learning of Structured Data

Isabela Cunha Maia Nobre

In the domains of machine learning, data science and signal processing, graph or network data, is becoming increasingly popular. It represents a large portion of the data in computer, transportation systems, energy networks, social, biological, and other s ...

EPFL2022

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

Nikolaos Geroliminis, Anastasios Kouvelas, Dimitrios Tsitsokas

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 ...

2022

Method for labelling a device and devices obtanaible therefrom

Ludovic Serex, Nicolas Vachicouras, Florian Dylan Fallegger

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 ...

2022

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

Kim-Manuel Klein, Klaus Jansen, Alexandra Anna Lassota

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 = ...

SPRINGER HEIDELBERG2022

HolA: Holistic and Autonomous Attestation for IoT Networks

Eleonora Losiouk, Flavio Toffalini

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 ...

SPRINGER INTERNATIONAL PUBLISHING AG2022

Transparent composite nano-fibre based multi-layer textile

Klaus Benedikt Schönenberger, Thierry Pelet

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 ...

2021

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

Jakub Kucka

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 ...

IEEE2021

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

Wulfram Gerstner, Clément Hongler, Johanni Michael Brea, Francesco Spadaro, Berfin Simsek, Arthur Jacot

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 ...

2021

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

Colin Neil Jones, Andrea Alessandretti, Ye Pu, Francisco Fernandes Castro Rego

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 ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2021

Atomic subgraphs and the statistical mechanics of networks

Sofia Charlotta Olhede

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 ...

2021

Bayesian Decision Making in Groups is Hard

Jan Hazla

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 ...

INFORMS2021

Automating cutting planes is NP-hard

Mika Tapani Göös

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, ...

ACM2021

Page 2 sur 2