Abstract--Is the temporal dimension alone sufficient to characterize contacts in opportunistic networks? Several studies analyze the temporal aspect of contacts with significant re...
Nadjet Belblidia, Marcelo Dias de Amorim, Jeremie ...
In this paper we analyze the Ricean K-factor for vehicle-to-vehicle (V2V) communications in a typical open suburban street crossing. The channel conditions vary from non line-of si...
The goal of graph clustering is to partition objects in a graph database into different clusters based on various criteria such as vertex connectivity, neighborhood similarity or t...
Abstract. An important unsolved problem in structural bioinformatics is that of protein structure prediction (PSP), the reconstruction of a biologically plausible three-dimensional...
Stefano Teso, Cristina Di Risio, Andrea Passerini,...
We study Timed Branching Processes (TBPs), a natural extension of (multitype) Branching Processes (BPs) where each entity is equipped with a finite set of private continuous variab...