1326 search results - page 56 / 266 » Approximate Tree Kernels |
SODA
2010
ACM
14 years 6 months ago
2010
ACM
The minimum latency problem (MLP) is a well-studied variant of the traveling salesman problem (TSP). In the MLP, the server's goal is to minimize the average latency that the...
MOC
2000
13 years 8 months ago
2000
In the approximation of linear elliptic operators in mixed form, it is well known that the so-called inf-sup and ellipticity in the kernel properties are sufficient (and, in a sens...
MIAR
2006
IEEE
14 years 2 months ago
2006
IEEE
Abstract. In this paper, we present a novel approach to matching cerebral vascular trees obtained from 3D-RA data-sets based on minimization of tree edit distance. Our approach is ...
STACS
1999
Springer
14 years 28 days ago
1999
Springer
We present a new technique called balanced randomized tree splitting. It is useful in constructing unknown trees recursively. By applying it we obtain two new results on efficient ...
ICDE
2010
IEEE
14 years 8 months ago
2010
IEEE
Abstract-- We consider the Top-k Approximate Subtree Matching (TASM) problem: finding the k best matches of a small query tree, e.g., a DBLP article with 15 nodes, in a large docum...