767 search results - page 50 / 154 » On Clustering Using Random Walks |
INFOCOM
2005
IEEE
14 years 2 months ago
2005
IEEE
— We define “random trip", a generic mobility model for independent mobiles that contains as special cases: the random waypoint on convex or non convex domains, random wa...
NAS
2007
IEEE
14 years 3 months ago
2007
IEEE
In cluster-based storage systems, the metadata server cluster must be able to adaptively distribute responsibility for metadata to maintain high system performance and long-term l...
PRL
2007
13 years 8 months ago
2007
We present a method for initialising the K-means clustering algorithm. Our method hinges on the use of a kd-tree to perform a density estimation of the data at various locations. ...
STACS
2007
Springer
14 years 2 months ago
2007
Springer
One frequently studied problem in the context of information dissemination in communication networks is the broadcasting problem. In this paper, we study the following randomized b...
RAID
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. One of the most challenging applications of wireless networking are in disaster area networks where lack of infrastructure, limited energy resources, need for common oper...