Abstract--As the information flowing around in social networking systems is mainly related or can be attributed to their users, controlling access to such information by individual...
We develop approximation algorithms for the problem of placing replicated data in arbitrary networks, where the nodes may both issue requests for data objects and have capacity fo...
In sparse and intermittently connected Mobile Sensor Networks (MSNs), the base station cannot easily get the data objects acquired by the mobile sensors in the field. When users q...
In this paper, we present a free-and-easy data publishing and sharing system based on folksonomy. The system accepts data objects described with user-created metadata, called data...
Many contemporary approaches for speeding up large file transfers attempt to download chunks of a data object from multiple sources. Systems such as BitTorrent quickly locate sou...
Himabindu Pucha, David G. Andersen, Michael Kamins...
The paper introduces a framework for clustering data objects in a similarity-based context. The aim is to cluster objects into a given number of classes without imposing a hard pa...
Peers and data objects in the Hybrid Overlay Network (HON) are organized in a ndimensional feature space. As the dimensionality increases, peers and data objects become sparse and ...
algorithms as networks of modules. The data flow architecture is popular because of the flexibility of mixing calculation modules with display modules, and because of its easy grap...
William L. Hibbard, Charles R. Dyer, Brian E. Paul
We will try to address the need for a formal foundation for visualization by taking an analytic approach to defining D. Since an arbitrary function D: U V will not produce display...
William L. Hibbard, Charles R. Dyer, Brian E. Paul
This work is a contribution to the developing literature on multi-resolution data models. It considers operations for model-oriented generalization in the case where the underlying...