4095 search results - page 42 / 819 » How to test a tree |
BMCBI
2008
13 years 7 months ago
2008
Background: When term ambiguity and variability are very high, dictionary-based Named Entity Recognition (NER) is not an ideal solution even though large-scale terminological reso...
LFCS
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Balanced search trees provide guaranteed worst-case time performance and hence they form a very important class of data structures. However, the self-balancing ability co...
ICN
2001
Springer
14 years 6 days ago
2001
Springer
Abstract. Core-based multicast trees use less router state, but have significant drawbacks when compared to shortest-path trees, namely higher delay and poor fault tolerance. We e...
AUSDM
2006
Springer
13 years 11 months ago
2006
Springer
When different subsamples of the same data set are used to induce classification trees, the structure of the built classifiers is very different. The stability of the structure of ...
STOC
1992
ACM
13 years 11 months ago
1992
ACM
Abstract. We describe two methods for estimating the size and depth of decision trees where a linear test is performed at each node. Both methods are applied to the question of dec...