Sciweavers

1326 search results - page 55 / 266
» Approximate Tree Kernels
Sort
View
SISAP
2010
IEEE
108views Data Mining» more  SISAP 2010»
13 years 6 months ago
Enlarging nodes to improve dynamic spatial approximation trees
Marcelo Barroso, Nora Reyes, Rodrigo Paredes
NIPS
2000
13 years 10 months ago
Text Classification using String Kernels
We propose a novel approach for categorizing text documents based on the use of a special kernel. The kernel is an inner product in the feature space generated by all subsequences...
Huma Lodhi, John Shawe-Taylor, Nello Cristianini, ...
AAIM
2010
Springer
155views Algorithms» more  AAIM 2010»
13 years 11 months ago
The (K, k)-Capacitated Spanning Tree Problem
Abstract. This paper considers a generalization of the capacitated spanning tree, in which some of the nodes have capacity K, and the others have capacity k < K. We prove that t...
Esther M. Arkin, Nili Guttmann-Beck, Refael Hassin
IPL
2002
105views more  IPL 2002»
13 years 8 months ago
Steiner trees in uniformly quasi-bipartite graphs
The area of approximation algorithms for the Steiner tree problem in graphs has seen continuous progress over the last years. Currently the best approximation
Clemens Gröpl, Stefan Hougardy, Till Nierhoff...