Sciweavers

151 search results - page 20 / 31
» Rearranging data objects for efficient and stable clustering
Sort
View
84
Voted
PAKDD
2010
ACM
198views Data Mining» more  PAKDD 2010»
15 years 4 months ago
A Better Strategy of Discovering Link-Pattern Based Communities by Classical Clustering Methods
Abstract. The definition of a community in social networks varies with applications. To generalize different types of communities, the concept of linkpattern based community was pr...
Chen-Yi Lin, Jia-Ling Koh, Arbee L. P. Chen
WWW
2003
ACM
16 years 10 days ago
Application specific data replication for edge services
The emerging edge services architecture promises to improve the availability and performance of web services by replicating servers at geographically distributed sites. A key chal...
Lei Gao, Michael Dahlin, Amol Nayate, Jiandan Zhen...
89
Voted
TPDS
2008
91views more  TPDS 2008»
14 years 11 months ago
SSW: A Small-World-Based Overlay for Peer-to-Peer Search
Peer-to-peer (P2P) systems have become a popular platform for sharing and exchanging voluminous information among thousands or even millions of users. The massive amount of inform...
Mei Li, Wang-Chien Lee, Anand Sivasubramaniam, Jin...
ICDE
1987
IEEE
81views Database» more  ICDE 1987»
15 years 3 months ago
Multidimensional Dynamic Quantile Hashing is Very Efficient for Non-Uniform Record Distributions
: Previous multidimensional dynamic hashing schemes exhibit two obvious shortcomings. First, even for uniform record distribution, the retrieval performance of these schemes suffer...
Hans-Peter Kriegel, Bernhard Seeger
HPDC
2007
IEEE
15 years 3 months ago
MOB: zero-configuration high-throughput multicasting for grid applications
Grid applications often need to distribute large amounts of data efficiently from one cluster to multiple others (multicast). Existing methods usually arrange nodes in optimized t...
Mathijs den Burger, Thilo Kielmann