1326 search results - page 15 / 266 » Approximate Tree Kernels |
112
click to vote
IJON
2006
15 years 2 months ago
2006
We present a framework for efficient extrapolation of reduced rank approximations, graph kernels, and locally linear embeddings (LLE) to unseen data. We also present a principled ...
110
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
Recent experimental work has suggested that the neural firing rate can be interpreted as a fractional derivative, at least when signal variation induces neural adaptation. Here, ...
134
click to vote
ISAAC
1998
Springer
15 years 6 months ago
1998
Springer
Let G = (V; E; w) be an undirected graph with nonnegative edge length function w and nonnegative vertex weight function r. The optimal product-requirement communication spanning t...
147
click to vote
WADS
2007
Springer
15 years 8 months ago
2007
Springer
We present a polynomial-time approximation scheme (PTAS) for the Steiner tree problem with polygonal obstacles in the plane with running time O(n log2 n), where n denotes the numb...
114
click to vote
PODS
2010
ACM
15 years 7 months ago
2010
ACM
XML Schema Definitions (XSDs) can be adequately abstracted by the single-type regular tree languages. It is wellknown, that these form a strict subclass of the robust class of re...