1326 search results - page 66 / 266 » Approximate Tree Kernels |
NETWORKS
2010
13 years 7 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...
SAS
2000
Springer
14 years 8 days ago
2000
Springer
We present a new representation for possibly infinite sets of possibly infinite trees. This representation makes extensive use of sharing to achieve efficiency. As much as possible...
COLT
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. The Gram matrix plays a central role in many kernel methods. Knowledge about the distribution of eigenvalues of the Gram matrix is useful for developing appropriate model...
SODA
1992
ACM
13 years 10 months ago
1992
ACM
We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph wit...
ASPLOS
2012
ACM
12 years 4 months ago
2012
ACM
Software developers commonly exploit multicore processors by building multithreaded software in which all threads of an application share a single address space. This shared addre...