767 search results - page 33 / 154 » On Clustering Using Random Walks |
136
Voted
CAV
2001
Springer
15 years 6 months ago
2001
Springer
We consider the randomized consensus protocol of Aspnes and Herlihy for achieving agreement among N asynchronous processes that communicate via read/write shared registers. The alg...
119
click to vote
EURONGI
2008
Springer
15 years 4 months ago
2008
Springer
In this paper, we propose a new mobility model as an extension of the random walk model. Our proposal gathers mobility patterns with several degrees of randomness, so that both ran...
141
click to vote
IJAHUC
2008
15 years 2 months ago
2008
: Random walk and flooding are basic mechanisms for searching unstructured overlays. This paper shows that node coverage is an important metric for query performance in random grap...
101
Voted
ICPR
2002
IEEE
16 years 3 months ago
2002
IEEE
We explore the idea of evidence accumulation for combining the results of multiple clusterings. Initially, n d-dimensional data is decomposed into a large number of compact cluste...
111
Voted
GECCO
2007
Springer
15 years 8 months ago
2007
Springer
This paper investigates the ability of a tournament selection based genetic algorithm to find mutationally robust solutions to a simple combinatorial optimization problem. Two di...