1248 search results - page 75 / 250 » Decision Tree Grafting |
142
click to vote
DAC
2008
ACM
16 years 5 months ago
2008
ACM
In this paper, we present DeFer -- a fast, high-quality and nonstochastic fixed-outline floorplanning algorithm. DeFer generates a non-slicing floorplan by compacting a slicing fl...
126
click to vote
ACL
2006
15 years 5 months ago
2006
Parsing is a computationally intensive task due to the combinatorial explosion seen in chart parsing algorithms that explore possible parse trees. In this paper, we propose a meth...
164
click to vote
DIS
2001
Springer
15 years 9 months ago
2001
Springer
In the context of classification problems, algorithms that generate multivariate trees are able to explore multiple representation languages by using decision tests based on a com...
141
click to vote
TSD
2000
Springer
15 years 8 months ago
2000
Springer
The aim of this paper is to describe and evaluate a system that automates a part of the transition from analytical to tectogrammatical tree structures within the Prague Dependency...
106
click to vote
ECML
2005
Springer
15 years 10 months ago
2005
Springer
Probability trees (or Probability Estimation Trees, PET’s) are decision trees with probability distributions in the leaves. Several alternative approaches for learning probabilit...