This paper revisits the two-hop forwarding policy in delay tolerant networks (DTNs) using simple probabilistic arguments. Closed form expressions are derived for the main performan...
To analyze the complexity of object-oriented software, several metrics have been proposed. Among them, Chidamber and Kemerer's metrics are well-known ones as object-oriented ...
We wish to endow the manifold M of smooth curves in lRn with a Riemannian metric that allows us to treat continuous morphs (homotopies) between two curves c0 and c1 as trajectorie...
Background: The search for cluster structure in microarray datasets is a base problem for the so-called “-omic sciences”. A difficult problem in clustering is how to handle da...
Probabilistic inference was shown effective in non-deterministic diagnosis of end-to-end service failures. Since exact probabilistic diagnosis is known to be an NP-hard problem, a...