Abstract. When drawing graphs whose nodes contain text or graphics, the non-trivial node sizes must be taken into account, either as part of the initial layout or as a post-processing step. The core problem is to avoid overlaps while retaining the structural information inherent in a layout using little additional area. This paper presents a new node overlap removal algorithm that does well by ...

When drawing graphs whose nodes contain text or graphics, the nontrivial node sizes must be taken into account, either as part of the initial layout or as a post-processing step. The core problem in avoiding or removing overlaps is to retain the structural information inherent in a layout while minimizing the additional area required. This paper presents a new node overlap removal algorithm tha...

This paper introduces a new view on fitness evaluation when searching for robust optima. It proposes to compare solutions in (successive) populations with respect to how they rank in robustness instead of aiming for accurate robustness estimates. This can be done by focusing on the non-overlapping parts of the regions of uncertainty of each pair of candidate solutions. An initial step toward a ...

Road networks are important for modelling the urban geographic environment. It is necessary to determine the spatial relationships of road intersections when using maps to help researchers conduct virtual urban geographic experiments (because a road intersection might occur as a connected cross or as an unconnected bridge overpass). Based on the concept of using different map layers to organize...

Feature selection is an important step when building a classifier on high dimensional data. As the number of observations is small, the feature selection tends to be unstable. It is common that two feature subsets, obtained from different datasets but dealing with the same classification problem, do not overlap significantly. Although it is a crucial problem, few works have been done on the sel...

Easy access to the World Wide Web has raised concerns about copyright issues and plagiarism. It is easy to copy someone else’s work and submit it as someone’s own. This problem has been targeted by many systems, which use very similar approaches. These approaches are compared in this paper and suggestions are made when different strategies are more applicable than others. Some alternative appro...

The problem of packing ellipsoids of different sizes and shapes into an ellipsoidal container so as to minimize a measure of overlap between ellipsoids is considered. A bilevel optimization formulation is given, together with an algorithm for the general case and a simpler algorithm for the special case in which all ellipsoids are in fact spheres. Convergence results are proved and computationa...

In this paper we present a new prediction technique to compress a pair of satellite images that have significant overlap in the underlying spatial areas. When this prediction technique is combined with an existing lossless image set compression algorithm, the results are significantly better than those obtained by compressing each image individually. Even when there are significant differences ...

In the literature frontal crashes typically have been classified as full, large overlap, or small overlap impacts (SOI) in accordance with the degree of frontal area involvement. These classifications implicitly refer to the degree of longitudinal structure engagement during impact. While full and large overlap impacts have received considerable attention, SOI has undergone limited analyses thr...

Pareto Density Estimation (PDE) as defined in this work is a method for the estimation of probability density functions using hyperspheres. The radius of the hyperspheres is derived from optimizing information while minimizing set size. It is shown, that PDE is a very good estimate for data containing clusters of Gaussian structure. The behavior of the method is demonstrated with respect to clu...