1248 search results - page 208 / 250 » Decision Tree Grafting |
174
click to vote
COMPGEOM
1996
ACM
15 years 10 months ago
1996
ACM
We show that in the worst case, (ndd=2e;1 +n logn) sidedness queries are required to determine whether the convex hull of n points in IRd is simplicial, or to determine the number ...
163
click to vote
KDD
1997
ACM
15 years 10 months ago
1997
ACM
We address the problem of nding useful regions for two-dimensional association rules and decision trees. In a previous paper we presented ecient algorithms for computing optimiz...
136
click to vote
FOCS
1993
IEEE
15 years 10 months ago
1993
IEEE
Let M be a fixed finite monoid. We consider the problem of implementing a data type containing a vector x ϭ ( x1, x2, . . . , xn) ʦ Mn , initially (1, 1, . . . , 1), with two kin...
175
click to vote
ICCAD
1994
IEEE
15 years 10 months ago
1994
IEEE
We examine the implications of a new hazard-free combinational logic synthesis method [8], which generates multiplexor trees from binary decision diagrams (BDDs) -- representation...
178
click to vote
GIS
1992
ACM
15 years 9 months ago
1992
ACM
Machine learning techniques such as tree induction have become accepted tools for developing generalisations of large data sets, typically for use with production rule systems in p...