Sciweavers

197 search results - page 2 / 40
» Answering complex questions with random walk models
Sort
View
SODA
2008
ACM
105views Algorithms» more  SODA 2008»
13 years 7 months ago
Deterministic random walks on regular trees
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...
Joshua N. Cooper, Benjamin Doerr, Tobias Friedrich...
EMNLP
2007
13 years 7 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
CORR
2012
Springer
272views Education» more  CORR 2012»
12 years 2 months ago
Fast and Exact Top-k Search for Random Walk with Restart
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...
Yasuhiro Fujiwara, Makoto Nakatsuji, Makoto Onizuk...
AAAI
2004
13 years 7 months ago
Towards Efficient Sampling: Exploiting Random Walk Strategies
From a computational perspective, there is a close connection between various probabilistic reasoning tasks and the problem of counting or sampling satisfying assignments of a pro...
Wei Wei, Jordan Erenrich, Bart Selman
SYNTHESE
2008
84views more  SYNTHESE 2008»
13 years 6 months ago
Model structure adequacy analysis: selecting models on the basis of their ability to answer scientific questions
Models carry the meaning of science. This puts a tremendous burden on the process of model selection. In general practice, models are selected on the basis of their relative goodne...
Mark L. Taper, David F. Staples, Bradley B. Shepar...