In this paper, we consider a map labeling problem to maximize the number of independent labels in the plane. We first investigate the point labeling model that each label can be ...
In the b-degree constrained Euclidean minimum spanning tree problem (bMST) we are given n points in [0;1]d and a degree constraint b 2. The aim is to nd a minimum weight spannin...
: Utility companies worldwide are facing a multitude of new challenges, which can not be met with the historically grown, monolithic IT systems currently in use. Service oriented a...
Abstract. An algorithm to detect invisible relevant persons in a homogeneous social network is studied with computer simulation. The network is effective as a model for contempora...
We describe an algorithm for manipulating the temporal resolution of a video in real time, contingent upon the viewer’s direction of gaze. The purpose of this work is to study t...