1186 search results - page 1 / 238 » Improving Random Walk Performance |
CSC
2009
13 years 6 months ago
2009
Random walk simulation is employed in many experimental algorithmic applications. Efficient execution on modern computer architectures demands that the random walk be implemented t...
AAAI
1994
13 years 6 months ago
1994
It has recently been shown that local search is surprisingly good at nding satisfying assignments for certain computationally hard classes of CNF formulas. The performance of basi...
ACL
2008
13 years 6 months ago
2008
ICPR
2008
IEEE
13 years 11 months ago
2008
IEEE
This paper presents a novel two-phase stereo matching algorithm using the random walks framework. At first, a set of reliable matching pixels is extracted with prior matrices de...
INFOCOM
2005
IEEE
13 years 10 months ago
2005
IEEE
— We study hybrid search schemes for unstructured peer-to-peer networks. We quantify performance in terms of number of hits, network overhead, and response time. Our schemes comb...