Mobile communication data analysis has been often used as a background application to motivate many data mining problems. However, very few data mining researchers have a chance t...
Tengjiao Wang, Bishan Yang, Jun Gao, Dongqing Yang...
— Routing protocols have traditionally been based on finding shortest paths under certain cost metrics. A conventional routing metric models the cost of a path as the sum of the...
Our research addresses two important problems that arise in modern large-scale distributed systems: (1) the necessity to virtualize their data flows by applying actions such as ...
Radhika Niranjan, Ada Gavrilovska, Karsten Schwan,...
Grid Workflows are emerging as practical programming models for solving large e-scientific problems on the Grid. However, it is typically assumed that the workflow components eith...
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...