Hierarchical clustering is used widely to organize data and search for patterns. Previous algorithms assume that the body of data being clustered is fixed while the algorithm runs...
H. Van Dyke Parunak, Richard Rohwer, Theodore C. B...
In this work we try to draw an interdisciplinary framework aimed to integrate a socio-cognitive approach with organizational research about industrial clusters, in order to invest...
Francesca Giardini, Gennaro di Tosto, Rosaria Cont...
We study four scheduling problems involving the maximum lateness criterion and an element of batching. For all the problems that we examine, algorithms appear in the literature th...
We present a new data structure that facilitates approximate nearest neighbor searches on a dynamic set of points in a metric space that has a bounded doubling dimension. Our data...