16430 search results - page 290 / 3286 » On Computable Tree Functions |
117
click to vote
IPPS
2000
IEEE
15 years 9 months ago
2000
IEEE
The mesh-of-trees topology has very attractive properties if a distance-sensitive routing, such as store-andforward, is used. How its properties compare to meshes if distance-inse...
117
click to vote
GD
2006
Springer
15 years 8 months ago
2006
Springer
In this paper, we study the k-tree partition problem which is a partition of the set of edges of a graph into k edge-disjoint trees. This problem occurs at several places with appl...
123
click to vote
SOFSEM
2000
Springer
15 years 8 months ago
2000
Springer
Abstract. In this paper we survey some results concerning balls-intobins-games and the power of two choices. We present a unified and rather elementary analysis for models in the p...
143
click to vote
GC
2010
Springer
15 years 3 months ago
2010
Springer
In this paper, we give a sufficient condition for a graph to have a degree bounded spanning tree. Let n ≥ 1, k ≥ 3, c ≥ 0 and G be an n-connected graph. Suppose that for eve...
120
Voted
ACL
2010
15 years 2 months ago
2010
This paper proposes a method of correcting annotation errors in a treebank. By using a synchronous grammar, the method transforms parse trees containing annotation errors into the...