Sciweavers

1503 search results - page 6 / 301
» Self-optimizing distributed trees
Sort
View
EUROPAR
2005
Springer
14 years 27 days ago
Distributed Maintenance of a Spanning Tree Using Labeled Tree Encoding
Maintaining spanning trees in a distributed fashion is central to many networking applications. In this paper, we propose a self-stabilizing algorithm for maintaining a spanning tr...
Vijay K. Garg, Anurag Agarwal
COLT
2003
Springer
14 years 18 days ago
Learning Random Log-Depth Decision Trees under the Uniform Distribution
We consider three natural models of random logarithmic depth decision trees over Boolean variables. We give an efficient algorithm that for each of these models learns all but an ...
Jeffrey C. Jackson, Rocco A. Servedio
CORR
2011
Springer
167views Education» more  CORR 2011»
13 years 2 months ago
Maximum Metric Spanning Tree made Byzantine Tolerant
Self-stabilization is a versatile approach to fault-tolerance since it permits a distributed system to recover from any transient fault that arbitrarily corrupts the contents of a...
Swan Dubois, Toshimitsu Masuzawa, Sébastien...
ICPADS
2005
IEEE
14 years 29 days ago
MeshTree: Reliable Low Delay Degree-bounded Multicast Overlays
We study decentralised low delay degree-constrained overlay multicast tree construction for single source real-time applications. This optimisation problem is NP-hard even if comp...
Su-Wei Tan, A. Gill Waters, John S. Crawford
COMPSAC
2006
IEEE
13 years 11 months ago
Distributed Processes on Tree Hash
We propose Tree Hash to reduce bucket overflow, which is one of the inherent problems in dynamic hash techniques. In this investigation, we dicuss how to improve efficien cy of Tre...
Kyosuke Yasuda, Takao Miura, Isamu Shioya