104 search results - page 18 / 21 » Nodes of large degree in random trees and forests |
IPPS
2003
IEEE
14 years 1 months ago
2003
IEEE
In this paper we investigate protocols for scheduling applications that consist of large numbers of identical, independent tasks on large-scale computing platforms. By imposing a ...
WWW
2005
ACM
14 years 9 months ago
2005
ACM
In this note we consider a simple reformulation of the traditional power iteration algorithm for computing the stationary distribution of a Markov chain. Rather than communicate t...
ACSAC
2009
IEEE
14 years 3 months ago
2009
IEEE
To protect privacy in large systems, users must be able to authenticate against a central server without disclosing their identity to the network. Private identification protocols ...
PODC
2004
ACM
14 years 2 months ago
2004
ACM
We analyze the properties of Small-World networks, where links are much more likely to connect “neighbor nodes” than distant nodes. In particular, our analysis provides new re...
COLT
2001
Springer
14 years 1 months ago
2001
Springer
The Kushilevitz-Mansour (KM) algorithm is an algorithm that finds all the “large” Fourier coefficients of a Boolean function. It is the main tool for learning decision trees ...