85 search results - page 8 / 17 » Scaling limit of random k-trees |
188
click to vote
TIT
2010
15 years 1 months ago
2010
Abstract--The goal of this paper is to increase our understanding of the fundamental performance limits of mobile and Delay Tolerant Networks (DTNs), where end-to-end multi-hop pat...
153
click to vote
CDC
2008
IEEE
16 years 28 days ago
2008
IEEE
Abstract— While peer-to-peer consensus algorithms have enviable robustness and locality for distributed estimation and computation problems, they have poor scaling behavior with ...
182
click to vote
ICDM
2010
IEEE
15 years 4 months ago
2010
IEEE
Abstract--Randomization is a general technique for evaluating the significance of data analysis results. In randomizationbased significance testing, a result is considered to be in...
171
click to vote
USITS
2003
15 years 7 months ago
2003
In this paper, we argue that a broad range of large-scale network services would benefit from a scalable mechanism for delivering state about a random subset of global participan...
183
click to vote
BMCBI
2007
15 years 6 months ago
2007
Background: Predicting protein complexes from experimental data remains a challenge due to limited resolution and stochastic errors of high-throughput methods. Current algorithms ...