970 search results - page 182 / 194 » On encodings of spanning trees |
177
click to vote
FOCS
2002
IEEE
15 years 11 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 ...
185
click to vote
IJCNN
2000
IEEE
15 years 10 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...
162
click to vote
INFOCOM
2000
IEEE
15 years 10 months ago
2000
IEEE
—Although IP Multicast is an effective network primitive for best-effort, large-scale, multi-point communication, many multicast applications such as shared whiteboards, multi-pl...
202
click to vote
GD
1998
Springer
15 years 10 months ago
1998
Springer
We demonstrate the H3Viewer graph drawing library, which can be run from a standalone program or in conjunction with other programs such as SGI's Site Manager application. Our...
203
click to vote
PODS
1994
ACM
15 years 10 months ago
1994
ACM
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...