Sciweavers

672 search results - page 87 / 135
» Lower-stretch spanning trees
Sort
View
COMPGEOM
1993
ACM
13 years 11 months ago
Worst-Case Bounds for Subadditive Geometric Graphs
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 ...
Marshall W. Bern, David Eppstein
COLING
2002
13 years 7 months ago
Hierarchical Orderings of Textual Units
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...
Alexander Mehler
RSA
2010
108views more  RSA 2010»
13 years 6 months ago
Resolvent of large random graphs
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...
Charles Bordenave, Marc Lelarge
ACL
2010
13 years 5 months ago
Dependency Parsing and Projection Based on Word-Pair Classification
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...
Wenbin Jiang, Qun Liu
ICASSP
2011
IEEE
12 years 11 months ago
Polytope kernel density estimates on Delaunay graphs
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...
Erhan Bas, Deniz Erdogmus