767 search results - page 5 / 154 » On Clustering Using Random Walks |
MOBICOM
2009
ACM
14 years 2 months ago
2009
ACM
In this paper we investigate the connectivity for large-scale clustered wireless sensor and ad hoc networks. We study the effect of mobility on the critical transmission range fo...
APPROX
2007
Springer
14 years 1 months ago
2007
Springer
We consider the problem of derandomizing random walks in the Euclidean space Rk . We show that for k = 2, and in some cases in higher dimensions, such walks can be simulated in Lo...
CLEF
2010
Springer
13 years 8 months ago
2010
Springer
In the third edition of WePS campaign we have undertaken the person name disambiguation problem referred to as a clustering task. Our aim was to make use of intrinsic link relation...
PAMI
2006
13 years 7 months ago
2006
We provide evidence that non-linear dimensionality reduction, clustering and data set parameterization can be solved within one and the same framework. The main idea is to define ...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
Given a sample from a probability measure with support on a submanifold in Euclidean space one can construct a neighborhood graph which can be seen as an approximation of the subm...