Sciweavers

1503 search results - page 143 / 301
» Self-optimizing distributed trees
Sort
View
112
Voted
IPPS
2006
IEEE
15 years 8 months ago
Parallel implementation of a quartet-based algorithm for phylogenetic analysis
This paper describes a parallel implementation of our recently developed algorithm for phylogenetic analysis on the IBM BlueGene/L cluster [15]. This algorithm constructs evolutio...
Bing Bing Zhou, Daniel Chu, Monther Tarawneh, Ping...
PODC
1990
ACM
15 years 6 months ago
Self-Stabilization of Dynamic Systems Assuming only Read/Write Atomicity
Three self-stabilizing protocols for distributed systems in the shared memory model are presented. The first protocol is a mutual exclusion protocol for tree structured systems. T...
Shlomi Dolev, Amos Israeli, Shlomo Moran
115
Voted
PDPTA
2003
15 years 3 months ago
Managing Flocking Objects with an Octree Spanning a Parallel Message-Passing Computer Cluster
We investigate the management of flocking mobile objects using a parallel message-passing computer cluster. An octree, a data structure well-known for use in managing a 3D space, ...
Thomas E. Portegys, Kevin M. Greenan
155
Voted
OSDI
2000
ACM
15 years 3 months ago
Overcast: Reliable Multicasting with an Overlay Network
Overcast is an application-level multicasting system that can be incrementally deployed using today's Internet infrastructure. These properties stem from Overcast's impl...
John Jannotti, David K. Gifford, Kirk L. Johnson, ...
SODA
2000
ACM
132views Algorithms» more  SODA 2000»
15 years 3 months ago
Expected-case complexity of approximate nearest neighbor searching
Most research in algorithms for geometric query problems has focused on their worstcase performance. However, when information on the query distribution is available, the alternat...
Sunil Arya, Ho-Yam Addy Fu