4137 search results - page 143 / 828 » On the number of matchings of a tree |
167
click to vote
PKDD
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. In this paper, we present an extensive study of the cuttingplane algorithm (CPA) applied to structural kernels for advanced text classification on large datasets. In par...
180
click to vote
NETWORKS
2010
15 years 4 months ago
2010
We provide first-time fixed-parameter tractability results for the NP-complete problems Maximum Full-Degree Spanning Tree and Minimum-Vertex Feedback Edge Set. These problems are...
193
click to vote
CVPR
2000
IEEE
16 years 8 months ago
2000
IEEE
Classifying an unknown input is a fundamental problem in Pattern Recognition. One standard method is finding its nearest neighbors in a reference set. It would be very time consum...
227
click to vote
ICANN
2007
Springer
15 years 10 months ago
2007
Springer
Within the taxonomy of feature extraction methods, recently the Wrapper approaches lost some popularity due to the associated computational burden, compared to Embedded or Filter m...
156
click to vote
IPPS
1999
IEEE
15 years 10 months ago
1999
IEEE
A binary-tree algorithm, Bin(n), proceeds level-bylevel from the leaves of a 2n -leaf balanced binary tree to its root. This paper deals with running binary-tree algorithms on mul...