It is well-known that, given a probability distribution over n characters, in the worst case it takes (n log n) bits to store a prefix code with minimum expected codeword length. H...
We introduce a new geometric, rank-based model for the link structure of on-line social networks (OSNs). In the geo-protean (GEO-P) model for OSNs nodes are identified with points ...
Abstract. In this paper we propose a method for automating the process of detecting regions of motion in a video sequence in real time. The main idea of this work is to detect moti...
In this paper, we start from an assigned control law with known probability distributions of its execution time. Our goal is to identify an optimised scheduling policy that allows ...
A model for statistical ranking is a family of probability distributions whose states are orderings of a xed nite set of items. We represent the orderings as maximal chains in a ...