1275 search results - page 210 / 255 » Chunking with Decision Trees |
FOCS
1998
IEEE
14 years 1 months ago
1998
IEEE
We examine the number T of queries that a quantum network requires to compute several Boolean functions on f0;1gN in the black-box model. We show that, in the blackbox model, the ...
ECAI
1998
Springer
14 years 1 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
14 years 1 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...
COMPGEOM
1996
ACM
14 years 1 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
14 years 1 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...