767 search results - page 117 / 154 » On Clustering Using Random Walks |
CSE
2009
IEEE
14 years 2 months ago
2009
IEEE
—We propose a parallel algorithm for finding Nash equilibria in n-player noncooperative games. The algorithm is based on enumerating the supports of mixed strategies in parallel...
ICALP
1992
Springer
13 years 11 months ago
1992
Springer
The "nearest neighbor" relation, or more generally the "k nearest neighbors" relation, defined for a set of points in a metric space, has found many uses in co...
HT
1991
ACM
13 years 11 months ago
1991
ACM
In order to combine hypertext with database facilities, we show how to extract an effective storage structure from given instance relationships. The schema of the structure recogn...
INFOSCALE
2006
ACM
14 years 1 months ago
2006
ACM
— The present paper introduces a replication method that is meant to balance the storage load of peers in unstructured peer-to-peer (P2P) networks for file sharing and to provid...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
Abstract—Breadth First Search (BFS) is a widely used approach for sampling large unknown Internet topologies. Its main advantage over random walks and other exploration technique...