We understand selection by intersection as distinguishing a single element of a set by the uniqueness of its occurrence in some other set. More precisely, given two sets A and B, i...
Much effort is spent everyday by programmers in trying to reduce long, failing execution traces to the cause of the error. We present a new algorithm for error cause localization ...
In this paper, we introduce a novel binary method for fast computation of an objective function to measure inter and intra class similarities, which is used for combining multiple...
Storage clusters try to transfer the idea of cluster com puting into the storage domain and to scale capacity and performance by simply adding new cluster components. This paper...
Abstract- The Maximum Homologous Crossover attempts to preserve similar structures from parents by aligning them according to their homology. In this paper, it is successfully test...
Michael Defoin-Platel, Manuel Clergue, Philippe Co...