338 search results - page 5 / 68 » Fast distributed random walks |
ICML
2004
IEEE
14 years 6 months ago
2004
IEEE
Many NLP tasks rely on accurately estimating word dependency probabilities P(w1|w2), where the words w1 and w2 have a particular relationship (such as verb-object). Because of the...
QUESTA
2002
13 years 5 months ago
2002
CP
2000
Springer
13 years 10 months ago
2000
Springer
Random Noise and Random Walk algorithms are local search strategies that have been used for the problem of satisfiability testing (SAT). We present a Markov-chain based analysis o...
ICML
2006
IEEE
14 years 6 months ago
2006
IEEE
Policy evaluation is a critical step in the approximate solution of large Markov decision processes (MDPs), typically requiring O(|S|3 ) to directly solve the Bellman system of |S...
RT
1998
Springer
13 years 10 months ago
1998
Springer
The paper presents a single-pass, view-dependent method to solve the general rendering equation, using a combined finite element and random walk approach. Applying finite element t...