1186 search results - page 7 / 238 » Improving Random Walk Performance |
154
click to vote
WWW
2004
ACM
16 years 6 months ago
2004
ACM
Theoretical analysis of the Web graph is often used to improve the efficiency of search engines. The PageRank algorithm, proposed by [5], is used by the Google search engine [4] t...
160
Voted
DAWAK
2005
Springer
15 years 11 months ago
2005
Springer
A biclustering algorithm, based on a greedy technique and enriched with a local search strategy to escape poor local minima, is proposed. The algorithm starts with an initial rando...
170
click to vote
ISCI
2008
15 years 5 months ago
2008
A biclustering algorithm, based on a greedy technique and enriched with a local search strategy to escape poor local minima, is proposed. The algorithm starts with an initial rand...
140
click to vote
EMNLP
2008
15 years 7 months ago
2008
We present a graph-based semi-supervised label propagation algorithm for acquiring opendomain labeled classes and their instances from a combination of unstructured and structured...
193
Voted
CCR
2004
15 years 5 months ago
2004
There has been much interest in both unstructured and structured overlays recently. Unstructured overlays, like Gnutella, build a random graph and use flooding or random walks on ...