2924 search results - page 354 / 585 » Lower Bounds in Distributed Computing |
145
click to vote
INFOCOM
2005
IEEE
15 years 10 months ago
2005
IEEE
Abstract— The distributed hash table (DHT) scheme has become the core component of many large-scale peer-to-peer networks. Degree, diameter, and congestion are important measures...
150
click to vote
ISAAC
2005
Springer
15 years 10 months ago
2005
Springer
Binary search trees are one of the most fundamental data structures. While the height of such a tree may be linear in the worst case, the average height with respect to the uniform...
171
click to vote
IWQOS
2001
Springer
15 years 9 months ago
2001
Springer
Ad-hoc wireless networks consist of mobile nodes interconnected by multi-hop wireless paths. Unlike conventional wireless networks, ad-hoc networks have no fixed network infrastru...
126
click to vote
SRDS
1999
IEEE
15 years 9 months ago
1999
IEEE
We study how to efficiently diffuse updates to a large distributed system of data replicas, some of which may exhibit arbitrary (Byzantine) failures. We assume that strictly fewer...
138
click to vote
NN
1997
Springer
15 years 8 months ago
1997
Springer
Bayesian networks are directed acyclic graphs that represent dependencies between variables in a probabilistic model. Many time series models, including the hidden Markov models (H...