307 search results - page 15 / 62 » Low-Distortion Embeddings of Trees |
ICDM
2006
IEEE
14 years 1 months ago
2006
IEEE
Due to their capability for expressing semantics and relationships among data objects, semi-structured documents have become a common way of representing domain knowledge. Compari...
CORR
2010
Springer
13 years 2 months ago
2010
Springer
For p 1, we prove that every forest with p trees whose sizes are a1, . . . , ap can be embedded in any graph containing at least p i=1(ai + 1) vertices and having minimum degree ...
SPAA
2004
ACM
14 years 1 months ago
2004
ACM
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
ASPDAC
2005
ACM
13 years 9 months ago
2005
ACM
The synthesis of clock network in the presence of process variation is becoming a vital design issue towards the performance of digital circuits. In this paper, we propose a clock ...
STOC
2003
ACM
14 years 8 months ago
2003
ACM
In this paper, we show that any n point metric space can be embedded into a distribution over dominating tree metrics such that the expected stretch of any edge is O(log n). This ...