344 search results - page 24 / 69 » Random Walks on Colored Graphs |
118
click to vote
TVCG
2011
14 years 4 months ago
2011
—This paper considers the problem of interactively finding the cutting contour to extract components from an existing mesh. First, we propose a constrained random walks algorith...
KDD
2010
ACM
15 years 1 months ago
2010
ACM
Many recommendation and retrieval tasks can be represented as proximity queries on a labeled directed graph, with typed nodes representing documents, terms, and metadata, and labe...
STOC
2003
ACM
15 years 10 months ago
2003
ACM
FOCS
1997
IEEE
15 years 1 months ago
1997
IEEE
LCN
2007
IEEE
15 years 3 months ago
2007
IEEE
Abstract—We study the performance of several search algorithms on unstructured peer-to-peer networks, both using classic search algorithms such as flooding and random walk, as w...