Sciweavers

750 search results - page 23 / 150
» Reconstruction for Models on Random Graphs
Sort
View
INFOCOM
2012
IEEE
13 years 5 months ago
On superposition of heterogeneous edge processes in dynamic random graphs
—This paper builds a generic modeling framework for analyzing the edge-creation process in dynamic random graphs in which nodes continuously alternate between active and inactive...
Zhongmei Yao, Daren B. H. Cline, Dmitri Loguinov
EMNLP
2007
15 years 4 months ago
Lexical Semantic Relatedness with Random Graph Walks
Many systems for tasks such as question answering, multi-document summarization, and information retrieval need robust numerical measures of lexical relatedness. Standard thesauru...
Thad Hughes, Daniel Ramage
MICS
2010
134views more  MICS 2010»
15 years 1 months ago
Scale Free Properties of Random k-Trees
Scale free graphs have attracted attention as their non-uniform structure that can be used as a model for many social networks including the WWW and the Internet. In this paper, w...
Colin Cooper, Ryuhei Uehara
SODA
2008
ACM
131views Algorithms» more  SODA 2008»
15 years 4 months ago
PageRank and the random surfer model
In recent years there has been considerable interest in analyzing random graph models for the Web. We consider two such models - the Random Surfer model, introduced by Blum et al....
Prasad Chebolu, Páll Melsted
LREC
2010
199views Education» more  LREC 2010»
15 years 4 months ago
A Random Graph Walk based Approach to Computing Semantic Relatedness Using Knowledge from Wikipedia
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...
Ziqi Zhang, Anna Lisa Gentile, Lei Xia, José...