4095 search results - page 603 / 819 » How to test a tree |
134
click to vote
EUROPAR
2004
Springer
15 years 8 months ago
2004
Springer
The BlueGene/L supercomputer will consist of 65,536 dual-processor compute nodes interconnected by two high-speed networks: a three-dimensional torus network and a tree topology ne...
133
click to vote
SENSYS
2003
ACM
15 years 8 months ago
2003
ACM
The widespread deployment of sensor networks is on the horizon. One of the main challenges in sensor networks is to process and aggregate data in the network rather than wasting e...
117
Voted
ICALP
2003
Springer
15 years 8 months ago
2003
Springer
The (k, r)-center problem asks whether an input graph G has ≤ k vertices (called centers) such that every vertex of G is within distance ≤ r from some center. In this paper we ...
148
Voted
FOCS
2002
IEEE
15 years 8 months ago
2002
IEEE
In recent years, gossip-based algorithms have gained prominence as a methodology for designing robust and scalable communication schemes in large distributed systems. The premise ...
154
click to vote
IJCNN
2000
IEEE
15 years 7 months ago
2000
IEEE
eresting web-available abstracts and papers on clustering: An Analysis of Recent Work on Clustering Algorithms (1999), Daniel Fasulo : This paper describes four recent papers on cl...