Users typically want their flows to complete as quickly as possible: They want a web-page to download quickly, or a file transfer to complete as rapidly as possible. In other words...
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...
The aim of an objective image quality assessment is to find an automatic algorithm that evaluates the quality of pictures or video as a human observer would do. To reach this goal...
Alexandre Ninassi, Olivier Le Meur, Patrick Le Cal...
— Server responsiveness and scalability are more important than ever in today’s client/server dominated network environments. Recently, researchers have begun to consider clust...
Xuehong Gan, Trevor Schroeder, Steve Goddard, Byra...
In this paper, we raise important issues on scalability and the required degree of supervision of existing Mahalanobis metric learning methods. Often rather tedious optimization p...