1326 search results - page 61 / 266 » Approximate Tree Kernels |
JUCS
2007
13 years 8 months ago
2007
: We give a tight analysis of an old and popular sweep-line heuristic for constructing a spanning tree of a set of n points in the plane. The algorithm sweeps a vertical line acros...
STOC
2003
ACM
14 years 9 months ago
2003
ACM
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
COMPGEOM
2011
ACM
13 years 8 days ago
2011
ACM
Starting with a similarity function between objects, it is possible to define a distance metric (the kernel distance) on pairs of objects, and more generally on probability distr...
SNPD
2004
13 years 10 months ago
2004
We proposed a new approach to compare profiles when the correlations among attributes can be represented as a tree. To account for these correlations, the profile is extended with...
TKDE
2012
11 years 11 months ago
2012
—Traditional clustering techniques are inapplicable to problems where the relationships between data points evolve over time. Not only is it important for the clustering algorith...