4095 search results - page 22 / 819 » How to test a tree |
EUROPAR
2003
Springer
14 years 28 days ago
2003
Springer
Abstract. Trees are useful data structures, but to design efficient parallel programs over trees is known to be more difficult than to do over lists. Although several important tre...
CVPR
2011
IEEE
12 years 11 months ago
2011
IEEE
How many people should you ask if you are not sure about your way? We provide an answer to this question for Random Forest classification. The presented method is based on the st...
ACL
2009
13 years 5 months ago
2009
The automatic extraction of relations between entities expressed in natural language text is an important problem for IR and text understanding. In this paper we show how differen...
ESA
1999
Springer
13 years 12 months ago
1999
Springer
Abstract. This paper addresses the informational asymmetry for constructing an ultrametric evolutionary tree from upper and lower bounds on pairwise distances between n given speci...
ICPR
2008
IEEE
14 years 9 months ago
2008
IEEE
The performance of off-line text-independent writer verification and identification increases when the documents contain more text. This relation was examined by repeatedly conduc...