Sciweavers

970 search results - page 100 / 194
» On encodings of spanning trees
Sort
View
COLING
2002
14 years 10 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»
14 years 8 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
14 years 8 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
102
Voted
ICASSP
2011
IEEE
14 years 1 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
94
Voted
LCN
2006
IEEE
15 years 4 months ago
Computing Real Time Jobs in P2P Networks
— 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...
Jingnan Yao, Jian Zhou, Laxmi N. Bhuyan