2487 search results - page 188 / 498 » Partitions of Graphs into Trees |
117
Voted
ECML
1997
Springer
15 years 8 months ago
1997
Springer
We investigate an inherent limitation of top-down decision tree induction in which the continuous partitioning of the instance space progressively lessens the statistical support o...
153
click to vote
STOC
2010
ACM
15 years 8 months ago
2010
ACM
The Steiner tree problem is one of the most fundamental ÆÈ-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum weight tree spanning ...
162
Voted
CGF
2010
15 years 3 months ago
2010
We present a novel image-based technique for modeling complex unfoliaged trees. Existing tree modeling tools either require capturing a large number of views for dense 3D reconstr...
122
Voted
WG
1997
Springer
15 years 8 months ago
1997
Springer
In this paper we present a parallel algorithm that decides whether a graph G has treewidth at most two, and if so, construct a tree decomposition or path decomposition of minimum ...
129
Voted
COLING
2008
15 years 5 months ago
2008
This paper describes a parameter estimation method for multi-label classification that does not rely on approximate inference. It is known that multi-label classification involvin...