115 search results - page 18 / 23 » Asymptotics for the Probability of Connectedness and the Dis... |
ICDCSW
2006
IEEE
14 years 3 months ago
2006
IEEE
The extent to which a wireless multi-hop network is connected is usually measured by the probability that all the nodes form a single connected component. We find this measure, c...
ICPP
2007
IEEE
14 years 3 months ago
2007
IEEE
The demand for more computational power in science and engineering has spurred the design and deployment of ever-growing cluster systems. Even though the individual components use...
STOC
2009
ACM
14 years 9 months ago
2009
ACM
A function on n variables is called a k-junta if it depends on at most k of its variables. In this article, we show that it is possible to test whether a function is a k-junta or ...
CSL
2000
Springer
13 years 8 months ago
2000
Springer
This paper introduces a new form of observation distributions for hidden Markov models (HMMs), combining subvector quantization and mixtures of discrete distrib utions. Despite w...
PODC
2009
ACM
14 years 9 months ago
2009
ACM
We present a randomized coloring algorithm for the unstructured radio network model, a model comprising autonomous nodes, asynchronous wake-up, no collision detection and an unkno...