767 search results - page 6 / 154 » On Clustering Using Random Walks |
ICC
2009
IEEE
14 years 3 months ago
2009
IEEE
—Random walk (RW) has been widely used as a strategy for searching in peer-to-peer networks. The boom of social network applications introduces new impact to the classical algori...
SODA
2003
ACM
13 years 10 months ago
2003
ACM
We consider the problem of uniformly sampling a vertex of a transportation polytope with m sources and n destinations, where m is a constant. We analyse a natural random walk on t...
ICPR
2008
IEEE
14 years 3 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...
CP
2000
Springer
14 years 28 days ago
2000
Springer
Random Noise and Random Walk algorithms are local search strategies that have been used for the problem of satisfiability testing (SAT). We present a Markov-chain based analysis o...
IPTPS
2005
Springer
14 years 2 months ago
2005
Springer
Application-level multicast on structured overlays often suffer several drawbacks: 1) The regularity of the architecture makes it difficult to adapt to topology changes; 2) the u...