148 search results - page 12 / 30 » Optimizing random walk search algorithms in P2P networks |
ICASSP
2011
IEEE
14 years 3 months ago
2011
IEEE
Network querying aims to search a large network for subnetwork regions that are similar to a given query network. In this paper, we propose a novel algorithm for querying large sc...
104
click to vote
ASPDAC
2009
ACM
15 years 6 months ago
2009
ACM
— Power distribution networks (PDNs) are designed and analyzed iteratively. Random walk is among the most efficient methods for PDN analysis. We develop in this paper an increme...
DAWAK
2005
Springer
15 years 5 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...
ISCI
2008
14 years 11 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...
125
click to vote
MSWIM
2006
ACM
15 years 5 months ago
2006
ACM
In recent years different authors have proposed the used of random-walk-based algorithms for varying tasks in the networking community. These proposals include searching, routing...