185 search results - page 7 / 37 » Local Algorithms for Finding Interesting Individuals in Larg... |
KDD
2003
ACM
14 years 8 months ago
2003
ACM
We are interested in finding natural communities in largescale linked networks. Our ultimate goal is to track changes over time in such communities. For such temporal tracking, we...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
: We study a slotted version of the Aloha Medium Access (MAC) protocol in a Mobile Ad-hoc Network (MANET). Our model features transmitters randomly located in the Euclidean plane, ...
SDM
2003
SIAM
13 years 9 months ago
2003
SIAM
The problem of finding clusters in data is challenging when clusters are of widely differing sizes, densities and shapes, and when the data contains large amounts of noise and out...
ICRA
2009
IEEE
14 years 2 months ago
2009
IEEE
— We study a fully distributed, reactive algorithm for deployment and maintenance of a mobile communication backbone that provides an area around a network gateway with wireless ...
KDD
2003
ACM
14 years 8 months ago
2003
ACM
Large and complex graphs representing relationships among sets of entities are an increasingly common focus of interest in data analysis--examples include social networks, Web gra...