Sciweavers

2463 search results - page 10 / 493
» Rankings of Directed Graphs
Sort
View
TAMC
2009
Springer
14 years 8 days ago
Feasibility of Motion Planning on Directed Graphs
Because of irreversibility of movements, motion planning on directed graphs is much more intricate than that on graphs. Recently we showed that the feasibility of motion planning o...
Zhilin Wu, Stéphane Grumbach
KDD
2007
ACM
244views Data Mining» more  KDD 2007»
14 years 8 months ago
A Recommender System Based on Local Random Walks and Spectral Methods
In this paper, we design recommender systems for weblogs based on the link structure among them. We propose algorithms based on refined random walks and spectral methods. First, w...
Zeinab Abbassi, Vahab S. Mirrokni
ML
2010
ACM
185views Machine Learning» more  ML 2010»
13 years 2 months ago
Learning to rank on graphs
Graph representations of data are increasingly common. Such representations arise in a variety of applications, including computational biology, social network analysis, web applic...
Shivani Agarwal
CIKM
2009
Springer
14 years 2 months ago
Learning to rank graphs for online similar graph search
Many applications in structure matching require the ability to search for graphs that are similar to a query graph, i.e., similarity graph queries. Prior works, especially in chem...
Bingjun Sun, Prasenjit Mitra, C. Lee Giles
APVIS
2004
13 years 9 months ago
Creating Minimal Vertex Series Parallel Graphs from Directed Acyclic Graphs
Visualizing information whose underlying graph is directed acyclic is easier if the graph is Minimal Vertex Series Parallel (MVSP). We present method of transforming any directed ...
Margaret Mitchell