We consider the problem of constructing a shortest Euclidean 2-connected Steiner network (SMN) for a set of terminals. This problem has natural applications in the design of survi...
K. Hvam, L. Reinhardt, Pawel Winter, Martin Zachar...
Ontologic knowledge is getting more and more important in agent-based systems, and its handling is becoming crucial for successful applications. But placing all the ontologyhandli...
For many applied problems in the context of clustering via mixture models, the estimates of the component means and covariance matrices can be affected by observations that are at...
A computationally fast procedure for identifying outliers is presented, that is particularly effective in high dimensions. This algorithm utilizes simple properties of principal c...
We investigate the following vertex percolation process. Starting with a random regular graph of constant degree, delete each vertex independently with probability p, where p = n-...
Catherine S. Greenhill, Fred B. Holt, Nicholas C. ...