Total path length, or search cost, for a rooted tree is defined as the sum of all root-to-node distances. Let Tn be the total path length for a random recursive tree of order n. M...
This paper addresses variational supervised texture segmentation. The main contributions are twofold. First, the proposed method circumvents a major problem related to classical t...
Ensemble methods such as bootstrap, bagging or boosting have had a considerable impact on recent developments in machine learning, pattern recognition and computer vision. Theoret...
In many service industries, companies compete with each other on the basis of the waiting time their customers experience, along with the price they charge for their service. A fi...
Recent work has shown how information theory extends conventional full-rationality game theory to allow bounded rational agents. The associated mathematical framework can be used ...