A deterministic algorithm for computing a minimum spanning tree of a connected graph is presented. Its running time is O(m (m, n)), where is the classical functional inverse of Ack...
Interval constraints can be used to solve problems in numerical analysis. In this paper we show that one can improve the performance of such an interval constraint program by the ...
Abstract: The vertices of regular four-dimensional polytopes are used to generate sets of uniformly distributed three-dimensional rotations, which are provided as tables of Euler a...
Salvatore Mamone, Giuseppe Pileio, Malcolm H. Levi...
The Gibbs sampling method has been widely used for sequence analysis after it was successfully applied to the problem of identifying regulatory motif sequences upstream of genes. ...
In this paper, the problem of discovering anomalies in a large-scale network based on the data fusion of heterogeneous monitors is considered. We present a classification of anoma...