Sciweavers

1503 search results - page 13 / 301
» Self-optimizing distributed trees
Sort
View
IPPS
2002
IEEE
14 years 10 days ago
Fault Recovery for a Distributed SP-Based Delay Constrained Multicast Routing Algorithm
This paper proposes a new distributed shortest path (SP) based delay constrained multicast routing algorithm which is capable of constructing a delay constrained multicast tree wh...
Hasan Ural, Keqin Zhu
RSA
2011
106views more  RSA 2011»
12 years 10 months ago
Distances between pairs of vertices and vertical profile in conditioned Galton-Watson trees
We consider a conditioned Galton–Watson tree and prove an estimate of the number of pairs of vertices with a given distance, or, equivalently, the number of paths of a given leng...
Luc Devroye, Svante Janson
RSA
2006
63views more  RSA 2006»
13 years 7 months ago
Random cutting and records in deterministic and random trees
We study random cutting down of a rooted tree and show that the number of cuts is equal (in distribution) to the number of records in the tree when edges (or vertices) are assigned...
Svante Janson
JMLR
2010
146views more  JMLR 2010»
13 years 2 months ago
Nonparametric Tree Graphical Models
We introduce a nonparametric representation for graphical model on trees which expresses marginals as Hilbert space embeddings and conditionals as embedding operators. This formul...
Le Song, Arthur Gretton, Carlos Guestrin
ICDCS
2003
IEEE
14 years 21 days ago
Optimal Distribution Tree for Internet Streaming Media
Internet radio and television stations require significant bandwidth to support delivery of high quality audio and video streams to a large number of receivers. IP multicast is a...
Min Sik Kim, Simon S. Lam, Dong-Young Lee