271 search results - page 14 / 55 » Quasi-isometries between graphs and trees |
CORR
2007
Springer
13 years 7 months ago
2007
Springer
A tree decomposition of the coordinates of a code is a mapping from the coordinate set to the set of vertices of a tree. A tree decomposition can be extended to a tree realization,...
INFOCOM
2008
IEEE
14 years 2 months ago
2008
IEEE
Abstract—Latency reduction in distributed interactive applications has been studied intensively. Such applications may have stringent latency requirements and dynamic user groups...
WOLLIC
2007
Springer
14 years 1 months ago
2007
Springer
Hydra games were introduced by Kirby and Paris, for the formulation of a result which is independent from Peano arithmetic but depends on the transfinite structure of 0. Tree ordi...
PLDI
1994
ACM
13 years 11 months ago
1994
ACM
In this paper, we describe the program structure tree (PST), a hierarchical representation of program structure based on single entry single exit (SESE) regions of the control flo...
VLDB
1999
ACM
13 years 12 months ago
1999
ACM
We present an external-memory algorithm for computing a minimum-cost edit script between two rooted, ordered, labeled trees. The I/O, RAM, and CPU costs of our algorithm are, resp...