970 search results - page 100 / 194 » On encodings of spanning trees |
98
Voted
COLING
2002
15 years 13 days 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...
97
Voted
RSA
2010
14 years 11 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...
107
Voted
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...
123
click to vote
ICASSP
2011
IEEE
14 years 4 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...
119
Voted
LCN
2006
IEEE
15 years 6 months ago
2006
IEEE
— In this paper, we present a distributed computing framework designed to support higher quality of service and fault tolerance for processing deadline-driven tasks in a P2P envi...