Sciweavers

115 search results - page 9 / 23
» Asymptotics for the Probability of Connectedness and the Dis...
Sort
View
CORR
2010
Springer
109views Education» more  CORR 2010»
13 years 9 months ago
Polynomial Learning of Distribution Families
Abstract--The question of polynomial learnability of probability distributions, particularly Gaussian mixture distributions, has recently received significant attention in theoreti...
Mikhail Belkin, Kaushik Sinha
INFOCOM
2002
IEEE
14 years 1 months ago
Stability of a Multicast Tree
— Most of the currently deployed multicast protocols (e.g. DVMRP, PIM, MOSPF) build one shortest path multicast tree per sender, the tree being rooted at the sender’s subnetwor...
Piet Van Mieghem, Milena Janic
RSA
2010
104views more  RSA 2010»
13 years 7 months ago
Random graphs with forbidden vertex degrees
We study the random graph Gn,λ/n conditioned on the event that all vertex degrees lie in some given subset S of the nonnegative integers. Subject to a certain hypothesis on S, the...
Geoffrey R. Grimmett, Svante Janson
AVSS
2006
IEEE
14 years 3 months ago
Large System Decision Fusion Performance in Inhomogeneous Sensor Networks
The problem of decision fusion in a large wireless sensor system with many power-constrained distributed nodes is considered. The sensor network is assumed to be inhomogeneous. i....
Sudharman K. Jayaweera, Kossai Al-Tarazi
CAAP
1992
14 years 1 months ago
Varieties of Increasing Trees
We extend results about heights of random trees (Devroye, 1986, 1987, 1998b). In this paper, a general split tree model is considered in which the normalized subtree sizes of node...
François Bergeron, Philippe Flajolet, Bruno...