Sciweavers

1692 search results - page 233 / 339
» Practical, distributed network coordinates
Sort
View
JPDC
2006
134views more  JPDC 2006»
15 years 1 months ago
Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
David A. Bader, Guojing Cong
CN
2007
117views more  CN 2007»
15 years 1 months ago
Secure multicast in dynamic environments
A secure multicast framework should only allow authorized members of a group to decrypt received messages; usually, one ‘‘group key’’ is shared by all approved members. Ho...
Chun-Ying Huang, Yun-Peng Chiu, Kuan-Ta Chen, Chin...
VLDB
2007
ACM
181views Database» more  VLDB 2007»
16 years 1 months ago
STAR: Self-Tuning Aggregation for Scalable Monitoring
We present STAR, a self-tuning algorithm that adaptively sets numeric precision constraints to accurately and efficiently answer continuous aggregate queries over distributed data...
Navendu Jain, Michael Dahlin, Yin Zhang, Dmitry Ki...
IPPS
2008
IEEE
15 years 8 months ago
Scalable server provisioning with HOP-SCOTCH
The problem of provisioning servers in a cluster infrastructure includes the issues of coordinating access and sharing of physical resources, loading servers with the appropriate ...
David Daly, M. A. Silva, José E. Moreira
ICDCS
2006
IEEE
15 years 7 months ago
A Hierarchical Approach to Internet Distance Prediction
Internet distance prediction gives pair-wise latency information with limited measurements. Recent studies have revealed that the quality of existing prediction mechanisms from th...
Rongmei Zhang, Y. Charlie Hu, Xiaojun Lin, Sonia F...