It is well-known that, of all graphs with edge-density p, the random graph G(n, p) contains the smallest density of copies of Kt,t, the complete bipartite graph of size 2t. Since ...
Abstract— In a peer-to-peer network, nodes are typically required to route packets for each other. This leads to a problem of “free-loaders,” nodes that use the network but r...
In this work we study some probabilistic models for the random generation of words over a given alphabet used in the literature in connection with pattern statistics. Our goal is t...
— One of the main concerns in ultra wide band (UWB) impulse radio (IR) technology is the presence of severe multiple access interference (MAI). Efficient receivers should theref...
In this paper, we present an optimized topology maintenance framework used in AVStreamer P2P media streaming system. To help new incoming clients get an initial view of the whole n...