1275 search results - page 120 / 255 » Chunking with Decision Trees |
ECAI
2000
Springer
14 years 2 months ago
2000
Springer
In this paper, an editing algorithm based on the projection of the examples in each dimension is presented. The algorithm, that we have called EOP (Editing by Ordered Projection) h...
ICALP
2001
Springer
14 years 2 months ago
2001
Springer
Given an undirected graph with positive edge weights, define Nq(v) for each node v to be the set of q nodes closest to v (including v itself and breaking ties by node ID). It is ...
NIPS
2004
13 years 11 months ago
2004
Prediction suffix trees (PST) provide a popular and effective tool for tasks such as compression, classification, and language modeling. In this paper we take a decision theoretic...
ISSAC
1995
Springer
14 years 1 months ago
1995
Springer
Dynamic evaluation is a technique for producing multiple results according to a decision tree which evolves with program execution. Sometimes it is desired to produce results for ...
SIGCOMM
1998
ACM
14 years 2 months ago
1998
ACM
In this paper, we present, QoSMIC, a multicast protocol for the Internet that supports QoS-sensitive routing, and minimizes the importance of a priori con guration decisions such...