Sciweavers

2614 search results - page 282 / 523
» Customizable Data Distribution for Shared Data Spaces
Sort
View
STOC
2003
ACM
188views Algorithms» more  STOC 2003»
16 years 4 months ago
Almost random graphs with simple hash functions
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
Martin Dietzfelbinger, Philipp Woelfel
CLUSTER
2004
IEEE
15 years 8 months ago
An efficient end-host architecture for cluster communication
Cluster computing environments built from commodity hardware have provided a cost-effective solution for many scientific and high-performance applications. Likewise, middleware te...
Xin Qi, Gabriel Parmer, Richard West
ITNG
2007
IEEE
15 years 10 months ago
Practical Challenges Facing Communities of Interest in the Net-Centric Department of Defense
The United States Department of Defense (DoD) – one of the world’s largest heterogeneous and distributed enterprises – is transforming its information management and sharing...
C. L. Connors, M. A. Malloy
AINA
2009
IEEE
15 years 2 months ago
Approximating Travel Times Using Opportunistic Networking
Determining the time and means by which to travel from location A to location B for a person utilising a MANET requires the dissemination of both realtime and historic data. In thi...
Rudi Ball, Naranker Dulay
ICNP
2006
IEEE
15 years 10 months ago
DPTree: A Balanced Tree Based Indexing Framework for Peer-to-Peer Systems
— Peer-to-peer (P2P) systems have been widely used for exchange of voluminous information and resources among thousands or even millions of users. Since shared data are normally ...
Mei Li, Wang-Chien Lee, Anand Sivasubramaniam