253 search results - page 8 / 51 » Random Walks with Look-Ahead in Scale-Free Random Graphs |
SIAMDM
2010
13 years 3 months ago
2010
In this paper we consider the problem of computing the expected hitting time to a vertex for random walks on graphs. We give a method for computing an upper bound on the expected ...
ICML
2007
IEEE
14 years 9 months ago
2007
IEEE
Ranking nodes in graphs is of much recent interest. Edges, via the graph Laplacian, are used to encourage local smoothness of node scores in SVM-like formulations with generalizat...
LREC
2010
13 years 10 months ago
2010
Determining semantic relatedness between words or concepts is a fundamental process to many Natural Language Processing applications. Approaches for this task typically make use o...
WWW
2008
ACM
14 years 9 months ago
2008
ACM
The rapid growth of the number of videos in YouTube provides enormous potential for users to find content of interest to them. Unfortunately, given the difficulty of searching vid...
EMNLP
2007
13 years 10 months ago
2007
Many systems for tasks such as question answering, multi-document summarization, and information retrieval need robust numerical measures of lexical relatedness. Standard thesauru...