672 search results - page 87 / 135 » Lower-stretch spanning trees |
COMPGEOM
1993
ACM
15 years 3 months ago
1993
ACM
We consider graphs such as the minimum spanning tree, minimum Steiner tree, minimum matching, and traveling salesman tour for n points in the d-dimensional unit cube. For each of ...
COLING
2002
14 years 11 months ago
2002
Text representation is a central task for any approach to automatic learning from texts. It requires a format which allows to interrelate texts even if they do not share content w...
RSA
2010
14 years 10 months ago
2010
We analyze the convergence of the spectrum of large random graphs to the spectrum of a limit infinite graph. We apply these results to graphs converging locally to trees and deri...
102
click to vote
ACL
2010
14 years 10 months ago
2010
In this paper we describe an intuitionistic method for dependency parsing, where a classifier is used to determine whether a pair of words forms a dependency edge. And we also pro...
116
click to vote
ICASSP
2011
IEEE
14 years 3 months ago
2011
IEEE
We present a polytope-kernel density estimation (PKDE) methodology that allows us to perform exact mean-shift updates along the edges of the Delaunay graph of the data. We discuss...