1060 search results - page 2 / 212 » On the Discovery of Random Trees |
NETWORKING
2007
13 years 6 months ago
2007
Recently, Doubletree, a cooperative algorithm for large-scale topology discovery at the IP level, was introduced. Compared to classic probing systems, Doubletree discovers almost a...
ALGORITHMICA
2006
13 years 5 months ago
2006
We use large deviations to prove a general theorem on the asymptotic edge-weighted height Hn of a large class of random trees for which Hn c log n for some positive constant c. A...
RSA
2006
13 years 5 months ago
2006
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...
DAM
2010
13 years 5 months ago
2010
We study the quantity distance between node j and node n in a random tree of size n for increasing tree families. We give closed formul
INFORMATICALT
2008
13 years 5 months ago
2008
Abstract. Data stream mining has become a novel research topic of growing interest in knowledge discovery. Most proposed algorithms for data stream mining assume that each data blo...