Sciweavers

1756 search results - page 101 / 352
» Directed scale-free graphs
Sort
View
119
Voted
TALG
2008
97views more  TALG 2008»
15 years 3 months ago
On an infinite family of solvable Hanoi graphs
The Tower of Hanoi problem is generalized by placing pegs on the vertices of a given directed graph G with two distinguished vertices, S and D, and allowing moves only along arcs o...
Dany Azriel, Noam Solomon, Shay Solomon
PAMI
2007
202views more  PAMI 2007»
15 years 2 months ago
Weighted Graph Cuts without Eigenvectors A Multilevel Approach
—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....
Inderjit S. Dhillon, Yuqiang Guan, Brian Kulis
133
Voted
IPPS
2010
IEEE
15 years 1 months ago
Executing task graphs using work-stealing
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...
Kunal Agrawal, Charles E. Leiserson, Jim Sukha
SOCIALCOM
2010
15 years 1 months ago
Using Text Analysis to Understand the Structure and Dynamics of the World Wide Web as a Multi-Relational Graph
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...
Harish Sethu, Alexander Yates
184
Voted
ICASSP
2011
IEEE
14 years 7 months ago
Content preference estimation in online social networks: Message passing versus sparse reconstruction on graphs
We design two different strategies for computing the unknown content preferences in an online social network based on a small set of nodes in the corresponding social graph for wh...
Jacob Chakareski