1511 search results - page 25 / 303 » Randomness, lowness and degrees |
ICDM
2009
IEEE
15 years 6 months ago
2009
IEEE
—We describe an efficient algorithm for releasing a provably private estimate of the degree distribution of a network. The algorithm satisfies a rigorous property of differenti...
112
click to vote
ICMCS
2006
IEEE
15 years 5 months ago
2006
IEEE
Overlay multicast tree is widely used to support large-scale real-time multimedia applications. The scalability and the robustness are two key issues in the overlay structure desi...
DMTCS
2006
14 years 11 months ago
2006
We consider the problem of generating a random q-colouring of a graph G = (V, E). We consider the simple Glauber Dynamics chain. We show that if for all v V the average degree of...
SPAA
2003
ACM
15 years 5 months ago
2003
ACM
We propose a new approach for constructing P2P networks based on a dynamic decomposition of a continuous space into cells corresponding to servers. We demonstrate the power of thi...
STACS
2001
Springer
15 years 4 months ago
2001
Springer
We study effectively given positive reals (more specifically, computably enumerable reals) under a measure of relative randomness introduced by Solovay [32] and studied by Calud...