Publications related to A Lower Bound for Broadcasting in Mobile Ad Hoc Networks

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

Modeling and Evaluation of Mobility Management in mmWave Cellular Networks

5G cellular networks will enable new differentiated services and applications to support industry like healthcare, energy, automobile and security. These services will massively increase the number of attached devices like mobiles, sensors, and actuators, ...

Ieee2018

Maximum Throughput Gain of Compute-and-Forward for Multiple Unicast

Michael Christoph Gastpar, Jasper Goseling

Compute-and-Forward (CF), also known as reliable physical layer network coding, is a technique that provides the possibility of exploiting the features of broadcast and superposition in wireless networks. It has been shown that the throughput for multiple ...

Institute of Electrical and Electronics Engineers2014

Personalizing Top-k Processing Online in a Peer-to-Peer Social Tagging Network

Rachid Guerraoui, Anne-Marie Kermarrec

The rapidly increasing amount of user-generated content in social tagging systems provides a huge source of information. Yet, performing effective search in these systems is very challenging, especially when we seek the most appropriate items that match a ...

Assoc Computing Machinery2014

Rate allocation and optimized decoding in inter-session network coding

Eirina Bourtsoulatze

Recent advances in data processing and communication systems have led to a continuous increase in the amount of data communicated over today’s networks. These large volumes of data pose new challenges on the current networking infrastructure that only offe ...

EPFL2013

Is the Network Turing-Complete?

Dejan Kostic, Peter Peresini

Ensuring correct network behavior is hard. This is the case even for simple networks, and adding middleboxes only complicates this task. In this paper, we demonstrate a fundamental property of networks. Namely, we show a way of using a network to emulate t ...

2013

Exchanging Pairwise Secrets Efficiently

Christina Fragouli, Suhas Diggavi, Iris Safaka

We consider the problem where a group of wireless nodes, connected to the same broadcast domain, want to create pairwise secrets, in the presence of an adversary Eve, who tries to listen in and steal these secrets. Existing solutions assume that Eve cannot ...

Institute of Electrical and Electronics Engineers Inc.2013

Function computation via subspace coding

Christina Fragouli, Lorenzo Keller, Nikhil Karamchandani

This paper considers function computation in a network where intermediate nodes perform randomized network coding, through appropriate choice of the subspace codebooks at the source nodes. Unlike traditional network coding for comput- ing functions, that r ...

2013

Implementation of a Wireless Mesh Network of Ultra Light MAVs with Dynamic Routing

Dario Floreano, Bixio Rimoldi, Jean-Christophe Zufferey, Alberto Jimenez Pacheco, Yannick Gasser

This paper describes the implementation and characterisation of a mobile ad-hoc network (MANET) of ultra-light intelligent flying robots. The flying nature of the network makes it suitable to collect or disseminate content in urban areas or challenging ter ...

2012

Content Management in Mobile Wireless Networks

Francisco De Meneses Neves Ramos Dos Santos

Approximately one billion users have access to mobile broadband, through which they intend to obtain the same data they can reach using a wired connection. Because of the cost of transmitting data over a mobile-broadband connection and given that 3G networ ...

2012

A Lower Bound for Broadcasting in Mobile Ad Hoc Networks

Graph Chatbot

Chat with Graph Search

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

Modeling and Evaluation of Mobility Management in mmWave Cellular Networks

Maximum Throughput Gain of Compute-and-Forward for Multiple Unicast

Personalizing Top-k Processing Online in a Peer-to-Peer Social Tagging Network

Rate allocation and optimized decoding in inter-session network coding

Is the Network Turing-Complete?

Exchanging Pairwise Secrets Efficiently

Function computation via subspace coding

Implementation of a Wireless Mesh Network of Ultra Light MAVs with Dynamic Routing

Content Management in Mobile Wireless Networks

Content Management in Mobile Wireless Networks

Modeling and Evaluation of Mobility Management in mmWave Cellular Networks

Maximum Throughput Gain of Compute-and-Forward for Multiple Unicast

Is the Network Turing-Complete?

Personalizing Top-k Processing Online in a Peer-to-Peer Social Tagging Network

Function computation via subspace coding

Rate allocation and optimized decoding in inter-session network coding

Exchanging Pairwise Secrets Efficiently

Implementation of a Wireless Mesh Network of Ultra Light MAVs with Dynamic Routing

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