1326 search results - page 39 / 266 » Approximate Tree Kernels |
COMPGEOM
2007
ACM
14 years 18 days ago
2007
ACM
Given a point set P R2 , a subset Q P is an -kernel of P if for every slab W containing Q, the (1+)-expansion of W also contains P. We present a data-stream algorithm for mainta...
SODA
1998
ACM
13 years 10 months ago
1998
ACM
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between t...
GD
2003
Springer
14 years 1 months ago
2003
Springer
We exhibit a small problem kernel for the one-sided crossing minimization problem. This problem plays an important role in graph drawing algorithms based on the Sugiyama layering ...
PPSN
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. Taking inspiration from approximate ranking, this paper investigates the use of rank-based Support Vector Machine as surrogate model within CMA-ES, enforcing the invarian...
NIPS
2004
13 years 10 months ago
2004
The computation and memory required for kernel machines with N training samples is at least O(N2 ). Such a complexity is significant even for moderate size problems and is prohibi...