16 citations · 21 across the 8 of their papers we have counts for
8 papers
Hiding Latencies in Network-Based Image Loading for Deep Learning
Francesco Versaci, Giovanni Busonera
In the last decades, the computational power of GPUs has grown exponentially, allowing current deep learning (DL) applications to handle increasingly large amounts of data at a pro…
Shape and Performance of Fastest Paths over Networks with Interacting Selfish Agents
Marco Cogoni, Giovanni Busonera, Enrico Gobbetti
We study the evolution of the fastest paths (FP) in transportation networks under increasing congestion. Moving from the common edge-based to a path-based analysis, we examine the…
Predicting Network Congestion by Extending Betweenness Centrality to Interacting Agents
Marco Cogoni, Giovanni Busonera
We present a simple model to predict network activity at the edge level, by extending a known approximation method to compute Betweenness Centrality (BC) with a repulsive mechanism…
Estimating Peak-Hour Traffic Congestion Patterns For Interacting Agents On Urban Networks
Marco Cogoni, Giovanni Busonera, Francesco Versaci
We study the emergence of congestion patterns in urban networks by modeling vehicular interaction by means of a simple traffic rule and by using a set of measures inspired by the s…
On the stability of traffic breakup patterns in urban networks
Marco Cogoni, Giovanni Busonera
We investigate the behavior of extended urban traffic networks within the framework of percolation theory by using real and synthetic traffic data. Our main focus shifts from the s…
On the breakup patterns of urban networks under load
Marco Cogoni, Giovanni Busonera
The urban networks of London and New York City are investigated as directed graphs within the paradigm of graph percolation. It has been recently observed that urban networks show…
Ultrametricity of optimal transport substates for multiple interacting paths over a square lattice network
Marco Cogoni, Giovanni Busonera, Gianluigi Zanetti
We model a set of point-to-point transports on a network as a system of polydisperse interacting self-avoiding walks (SAWs) over a finite square lattice. The ends of each SAW may b…
Transition to congestion in communication/computation networks: from ideal to realistic resource allocation via Montecarlo simulations
Marco Cogoni, Giovanni Busonera, Paolo Anedda +1
We generalize previous studies on critical phenomena in communication networks by adding computational capabilities to the nodes to better describe real-world situations such as cl…