2429 search results - page 250 / 486 » Toposemantic Network Clustering |
208
click to vote
DSN
2007
IEEE
16 years 29 days ago
2007
IEEE
In this paper, we study replication techniques for scaling and continuous operation for a dynamic content server. Our focus is on supporting transparent and fast reconfiguration ...
161
click to vote
ICPADS
2007
IEEE
16 years 28 days ago
2007
IEEE
- Due to the increasing complexity of scientific models, large-scale simulation tools often require a critical amount of computational power to produce results in a reasonable amou...
168
click to vote
GC
2004
Springer
16 years 10 hour ago
2004
Springer
This paper presents a locality-based dissemination graph algorithm for scalable reliable broadcast. Our algorithm scales in terms of both network and memory usage. Processes only h...
181
click to vote
IPPS
2005
IEEE
16 years 6 days ago
2005
IEEE
“MegaProto” is a proof-of-concept prototype for our project “Mega-Scale Computing Based on Low-Power Technology and Workload Modeling”, implementing our key idea that a mi...
160
click to vote
KDD
2009
ACM
16 years 7 months ago
2009
ACM
Algorithms based on simulating stochastic flows are a simple and natural solution for the problem of clustering graphs, but their widespread use has been hampered by their lack of...