Given a data set, a dynamical procedure is applied to the data points in order to shrink and separate, possibly overlapping clusters. Namely, Newton’s equations of motion are em...
In this work the performance of several local search and metaheuristic methods is compared to previously reported work using evolutionary algorithms. The results show that while m...
— Our goal is polygonal approximation of laser range data points obtained by a mobile robot. The proposed approach provides a precise estimation of the number of model components...
Efficient use of an optimized memory hierarchy to exploit temporal locality in the memory accesses on array signals can have a very large impact on the power consumption in data ...
Jean-Philippe Diguet, Sven Wuytack, Francky Cattho...
— A critical problem facing by managing large-scale clusters is to identify the location of problems in a system in case of unusual events. As the scale of high performance compu...