767 search results - page 74 / 154 » On Clustering Using Random Walks |
151
click to vote
COMPGEOM
2001
ACM
15 years 9 months ago
2001
ACM
We propose a new randomized algorithm for maintaining a set of clusters among moving nodes in the plane. Given a specified cluster radius, our algorithm selects and maintains a va...
158
click to vote
PAMI
2010
15 years 4 months ago
2010
— We propose a randomized data mining method that finds clusters of spatially overlapping images. The core of the method relies on the min-Hash algorithm for fast detection of p...
150
click to vote
TACAS
2005
Springer
15 years 11 months ago
2005
Springer
We present MC2 , what we believe to be the first randomized, Monte Carlo algorithm for temporal-logic model checking, the classical problem of deciding whether or not a property s...
194
click to vote
ANSS
2004
IEEE
15 years 9 months ago
2004
IEEE
We quantatively analyze the differences between a realistic mobility model, TRANSIMS, and several synthetic mobility models. New synthetic models were created by modifying the sta...
162
click to vote
EJC
2006
15 years 6 months ago
2006
We find the asymptotic number of connected graphs with k vertices and k - 1 + l edges when k, l approach infinity, reproving a result of Bender, Canfield and McKay. We use the pro...