1736 search results - page 45 / 348 » The rank-width of Directed Graphs |
118
click to vote
EMNLP
2008
15 years 5 months ago
2008
We consider a parsed text corpus as an instance of a labelled directed graph, where nodes represent words and weighted directed edges represent the syntactic relations between the...
159
click to vote
MOBICOM
2012
ACM
13 years 6 months ago
2012
ACM
While a natural fit for modeling and understanding mobile networks, time-varying graphs remain poorly understood. Indeed, many of the usual concepts of static graphs have no obvi...
162
click to vote
PAMI
2007
15 years 3 months ago
2007
—A variety of clustering algorithms have recently been proposed to handle data that is not linearly separable; spectral clustering and kernel k-means are two of the main methods....
137
click to vote
IPPS
2010
IEEE
15 years 1 months ago
2010
IEEE
Abstract--NABBIT is a work-stealing library for execution of task graphs with arbitrary dependencies which is implemented as a library for the multithreaded programming language Ci...
160
click to vote
SOCIALCOM
2010
15 years 1 months ago
2010
A representation of the World Wide Web as a directed graph, with vertices representing web pages and edges representing hypertext links, underpins the algorithms used by web search...