Dynamic networks are characterized by transit times on edges. Dynamic flow problems consider transshipment problems in dynamic networks. We introduce a new version of dynamic fl...
In this paper, we introduce a new class of data mining problems called learning from aggregate views. In contrast to the traditional problem of learning from a single table of tra...
Bee-Chung Chen, Lei Chen 0003, Raghu Ramakrishnan,...
Abstract--We introduce multi-hop aggregate information efficiency (MIEA), a comprehensive metric that captures several performance-affecting factors of wireless ad hoc networks in ...
Pedro Henrique Juliano Nardelli, Giuseppe Thadeu F...
We study the problem of approximately answering aggregation queries using sampling. We observe that uniform sampling performs poorly when the distribution of the aggregated attrib...
— Recommender systems are becoming increasingly important to individual users and businesses for providing personalized recommendations. However, while the majority of algorithms...