159 search results - page 23 / 32 » Small world models for social network algorithms testing |
ICRA
2008
IEEE
14 years 3 months ago
2008
IEEE
— Over the last few years, the complexity of aquatic sensing applications has increased as a result of demands for: higher spatial coverage with high resolution monitoring, under...
CIKM
2009
Springer
14 years 3 months ago
2009
Springer
In this paper we study approximate landmark-based methods for point-to-point distance estimation in very large networks. These methods involve selecting a subset of nodes as landm...
SDM
2010
SIAM
13 years 10 months ago
2010
SIAM
Large graph databases are commonly collected and analyzed in numerous domains. For reasons related to either space efficiency or for privacy protection (e.g., in the case of socia...
IJPRAI
2002
13 years 8 months ago
2002
Decision-tree algorithms are known to be unstable: small variations in the training set can result in different trees and different predictions for the same validation examples. B...
FOCS
2008
IEEE
14 years 3 months ago
2008
IEEE
A plethora of random graph models have been developed in recent years to study a range of problems on networks, driven by the wide availability of data from many social, telecommu...