Sciweavers

44 search results - page 1 / 9
» On the distribution of distances between specified nodes in ...
Sort
View
DAM
2010
101views more  DAM 2010»
13 years 4 months ago
On the distribution of distances between specified nodes in increasing trees
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
Markus Kuba, Alois Panholzer
INFOCOM
2005
IEEE
13 years 10 months ago
Distributed querying of Internet distance information
— Estimation of network proximity among nodes is an important building block in several applications like service selection and composition, multicast tree formation, and overlay...
Rodrigo Fonseca, Puneet Sharma, Sujata Banerjee, S...
ISPD
2005
ACM
174views Hardware» more  ISPD 2005»
13 years 10 months ago
Fast and accurate rectilinear steiner minimal tree algorithm for VLSI design
In this paper, we present a very fast and accurate rectilinear Steiner minimal tree (RSMT)1 algorithm called FLUTE. The algorithm is an extension of the wirelength estimation appr...
Chris C. N. Chu, Yiu-Chung Wong
CORR
1998
Springer
110views Education» more  CORR 1998»
13 years 4 months ago
Ultrametric Distance in Syntax
Phrase structure trees have a hierarchical structure. In many subjects, most notably in taxonomy such tree structures have been studied using ultrametrics. Here syntactical hierar...
Mark D. Roberts
TON
2008
126views more  TON 2008»
13 years 4 months ago
Hyperbolic embedding of internet graph for distance estimation and overlay construction
Estimating distances in the Internet has been studied in the recent years due to its ability to improve the performance of many applications, e.g., in the peer-topeer realm. One sc...
Yuval Shavitt, Tomer Tankel