1326 search results - page 30 / 266 » Approximate Tree Kernels |
ESA
2004
Springer
14 years 2 months ago
2004
Springer
Let G = (V, E) be an undirected multi-graph with a special vertex root ∈ V , and where each edge e ∈ E is endowed with a length l(e) ≥ 0 and a capacity c(e) > 0. For a pa...
NIPS
2001
13 years 10 months ago
2001
We describe the application of kernel methods to Natural Language Processing (NLP) problems. In many NLP tasks the objects being modeled are strings, trees, graphs or other discre...
VLDB
2000
ACM
14 years 5 days ago
2000
ACM
We propose a novel index structure, A-tree (Approximation tree), for similarity search of high-dimensional data. The basic idea of the
ICCV
1999
IEEE
14 years 10 months ago
1999
IEEE
VIS
2009
IEEE
14 years 10 months ago
2009
IEEE
