307 search results - page 36 / 62 » Low-Distortion Embeddings of Trees |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Deciding whether a graph can be embedded in a grid using only unitlength edges is NP-complete, even when restricted to binary trees. However, it is not difficult to devise a numbe...
IJPP
2008
13 years 7 months ago
2008
We develop an all-to-all broadcast scheme that achieves maximum bandwidth efficiency for clusters with tree topologies. Using our scheme for clusters with cut-through switches, an...
TSP
2010
13 years 2 months ago
2010
We consider the problem of learning Gaussian multiresolution (MR) models in which data are only available at the finest scale and the coarser, hidden variables serve both to captu...
COCOON
1999
Springer
13 years 12 months ago
1999
Springer
We present results related to satisfying shortest path queries on a planar graph stored in external memory. Let N denote the number of vertices in the graph and let sort(N) denote...
SIES
2007
IEEE
14 years 2 months ago
2007
IEEE
— High level synthesis is one of the next major steps to improve the hw/sw co-design process. The advantages of high nthesis are two-fold. At first the level of abstraction is r...