The min-sum k-clustering problem is to partition a metric space (P, d) into k clusters C1, . . . , Ck ⊆ P such that k i=1 p,q∈Ci d(p, q) is minimized. We show the first effi...
Various query methods for video search exist. Because of the semantic gap each method has its limitations. We argue that for effective retrieval query methods need to be combined ...
— Using real mechanical controls, this experiment studied strength and reversibility of direction-of-motion stereotypes and response times for different configurations of digital...
: The theme of this issue of IJCINI is on cognitive mechanisms of autonomic computing and laws of human cooperative work organization. This editorial addresses key notions of this ...