Stable Routing And Unique-Max Coloring On Trees

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

We identified that in modern commercial FPGAs, routing signals from the general interconnect to the configurable logic blocks (CLBs) through a very sparse input interconnect block (IIB) represents a significant runtime bottleneck. This is despite academic ...

In-network devices around the world monitor and tamper with connections for many reasons, including intrusion prevention, combating spam or phishing, and country-level censorship. Connection tampering seeks to block access to specific domain names or keywo ...

Signalized intersections are a fundamental part of urban networks. Their understanding is crucial to identify congestion patterns, queues, delays, and safety issues in local and network level. In this work, we analyze multimodal vehicle trajectories and pr ...

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

Supplementary datasets accompanying the manuscript "ARBRE: Computational resource to predict pathways towards industrially important aromatic compounds" published in the Metabolic Engineering Journal (https://doi.org/10.1016/j.ymben.2022.03.013). In line w ...

Despite FPGAs rapidly evolving to support the requirements of the most demanding emerging applications, their high static power consumption, concentrated within the routing resources, still presents a major hurdle for low-power applications. Augmenting the ...

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

Today, it is common knowledge in the cyber-physical systems domain that the tight interaction between the cyber and physical elements provides the possibility of substantially improving the performance of these systems that is otherwise impossible. On the ...

We present an efficient and accurate people detection approach based on deep learning to detect people attacks and intrusion in video surveillance scenarios Unlike other approaches using background segmentation and pre-processing techniques, which are not ...

Network travel time reliability can be represented by a relationship between network space-mean travel time and the standard deviation of network travel time. The primary objective of this paper is to improve estimation of the network travel time reliabili ...

Datacenters are the heart of our digital lives. Online applications, such as social-networking and e-commerce, run inside datacenters under strict Service Level Objectives for their tail latency. Tight latency SLOs are necessary for such services to remain ...

We consider the problem of path inference: given a path prefix, i.e., a partially observed sequence of nodes in a graph, we want to predict which nodes are in the missing suffix. In particular, we focus on natural paths occurring as a by-product of the int ...

Distributed graph signal processing methods require that the graph nodes communicate by exchanging messages. These messages have a finite precision in a realistic network, which may necessitate to implement quantization. Quantization, in turn, generates er ...

Percolation, in its most general interpretation, refers to the “flow” of something (a physical agent, data or information) in a network, possibly accompanied by some nonlinear dynamical processes on the network nodes (sometimes denoted reaction–diffusion s ...

Wireless Sensor Networks (WSNs) are collections of sensing devices using wireless communication to exchange data. In the past decades, steep advancements in the areas of microelectronics and communication systems have driven an explosive growth in the depl ...

Real-time communication over Ethernet is becoming important in various application areas of cyber-physical systems such as industrial automation and control, avionics, and automotive networking. Since such applications are typically time critical, Ethernet ...

Today's Internet is not transparent: when packets get lost or delayed, there is typically no information about where the problem occurred, hence no information about who is responsible. This results in Internet service providers (ISPs) offering service lev ...

Many modern services need to routinely perform tasks on a large scale. This prompts us to consider the following question: How can we design efficient algorithms for large-scale computation? In this thesis, we focus on devising a general strategy to addr ...

We present a self-organised method for quickly obtaining the epidemic threshold of infective processes on networks. Starting from simple percolation models, we introduce the possibility that the effective infection probability is affected by the perception ...

This paper investigates the equilibrium properties of the morning commute problem at the network level with heterogeneous trip lengths. Congestion is modeled with a Macroscopic Fundamental Diagram relating the space-mean speed of a network to the vehicular ...

Stable Routing And Unique-Max Coloring On Trees

Chattez avec Graph Search

IIBLAST: Speeding Up Commercial FPGA Routing by Decoupling and Mitigating the Intra-CLB Bottleneck

Global, Passive Detection of Connection Tampering

An automatized signal timing detection at signalized intersections with detailed vehicle trajectory data

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

Supplementary datasets for "ARBRE: Computational resource to predict pathways towards industrially important aromatic compounds"

Shrinking FPGA Static Power via Machine Learning-Based Power Gating and Enhanced Routing

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

Security-aware Routing and Scheduling for Control Applications on Ethernet TSN Networks

WatchNet plus plus : efficient and accurate depth-based network for detecting people attacks and intrusion

Estimating network travel time reliability with network partitioning

Operating System and Network Co-Design for Latency-Critical Datacenter Applications

Extrapolating Paths with Graph Neural Networks

Optimized Quantization in Distributed Graph Signal Processing

Percolation and Internet Science

Routing for Wireless Sensor Networks: From Collection to Event-Triggered Applications

Stability-Aware Integrated Routing and Scheduling for Control Applications in Ethernet Networks

Traffic Receipts for Network Transparency

When Stuck, Flip a Coin : New Algorithms for Large-Scale Tasks

Risk Perception and Epidemics in Complex Computer Networks

The morning commute in urban areas with heterogeneous trip lengths