1923 search results - page 331 / 385 » Weighted Decision Trees |
ECAI
1998
Springer
15 years 4 months ago
1998
Springer
This paper presents a neural network approach to the problem of nding the dialogue act for a given utterance. So far only symbolic, decision tree and statistical approaches were ut...
LICS
1997
IEEE
15 years 4 months ago
1997
IEEE
Abstract. We prove that ground reducibility is EXPTIME-complete in the general case. EXPTIME-hardness is proved by encoding the emptiness problem for the intersection of recognizab...
110
click to vote
COMPGEOM
1996
ACM
15 years 4 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 ...
KDD
1997
ACM
15 years 4 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...
FOCS
1993
IEEE
15 years 4 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...