The de Bruijn digraph B(d, D) has degree d, diameter D, dD vertices and dD+1 arcs. It is usually defined by words of size D on an alphabet of cardinality d, through a cyclic left ...
Abstract--The batch resolution problem consists in arbitrating the channel access of a group of nodes in a wireless network in order to collect a single packet from each node in th...
In this paper we deal with codes identifying sets of vertices in random networks; that is, (1, ≤ ℓ)-identifying codes. These codes enable us to detect sets of faulty processor...
Alan M. Frieze, Ryan Martin, Julien Moncel, Mikl&o...
We consider the problem of rate-distortion optimal streaming of packetized media with sender-driven transmission over a single-QoS network using feedback and retransmissions. For ...
A serious problem in learning probabilistic models is the presence of hidden variables. These variables are not observed, yet interact with several of the observed variables. Dete...