50 search results - page 2 / 10 » Answering Opinion Questions with Random Walks on Graphs |
CORR
2012
Springer
13 years 5 months ago
2012
Springer
Graphs are fundamental data structures and have been employed for centuries to model real-world systems and phenomena. Random walk with restart (RWR) provides a good proximity sco...
SODA
2008
ACM
14 years 11 months ago
2008
ACM
Jim Propp's rotor router model is a deterministic analogue of a random walk on a graph. Instead of distributing chips randomly, each vertex serves its neighbors in a fixed or...
81
Voted
STOC
2002
ACM
15 years 10 months ago
2002
ACM
Two infinite walks on the same finite graph are called compatible if it is possible to introduce delays into them in such a way that they never collide. Years ago, Peter Winkler a...
104
Voted
CIKM
2008
Springer
14 years 11 months ago
2008
Springer
Although PageRank has been designed to estimate the popularity of Web pages, it is a general algorithm that can be applied to the analysis of other graphs other than one of hypert...
72
Voted
ACL
2006
14 years 11 months ago
2006
This interactive presentation describes LexNet, a graphical environment for graph-based NLP developed at the University of Michigan. LexNet includes LexRank (for text summarizatio...