In the k-medoid problem, given a dataset P, we are asked to choose k points in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points ...
Current networks require ad-hoc operating procedures by expert administrators to handle changes. These configuration management operations are costly and error prone. Active netwo...
Alexander V. Konstantinou, Danilo Florissi, Yechia...
Supporting continuous sensing applications on mobile phones is challenging because of the resource demands of long-term sensing, inference and communication algorithms. We present...
Hong Lu, Jun Yang, Zhigang Liu, Nicholas D. Lane, ...
This paper presents a scalable and self-optimizing architecture for Quality-of-Service (QoS) provisioning in the Differentiated Services (DiffServ) framework. The proposed archite...
One interesting way of accessing collections of multimedia objects is by methods of visualization and clustering. Growing self-organizing maps provide such a solution, which adapts...