This paper addresses the problem of deciding effectively whether to interrupt a teammate who may have information that is valuable for solving a collaborative scheduling problem. ...
This paper proposes efficient and robust methods for tracking a moving object at multiple spatial and temporal resolution levels. The efficiency comes from optimising the amounts ...
Sumantra Dutta Roy, Son Dinh Tran, Larry S. Davis,...
In content networks, a replication group refers to a set of nodes that cooperate with each other to retrieve information objects from a distant server. Each node locally replicates...
Eva Jaho, Ioannis Z. Koukoutsidis, Ioannis Stavrak...
A novel center-based clustering algorithm is proposed in this paper. We first formulate clustering as an NP-hard linear integer program and we then use linear programming and the ...
Conditional Random Sampling (CRS) was originally proposed for efficiently computing pairwise (l2, l1) distances, in static, large-scale, and sparse data. This study modifies the o...