![]() ![]() ![]() | ![]() |
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. Edoardo M. Airoldi Edoardo M. Airoldi, Kathleen M. Carley : Sampling algorithms for pure network topologies: a study on the stability and the separability of metric embeddings. SIGKDD Explorations 7 (2): 13-22 (2005) 1 [ 1 ] ![]() ©2006 Association for Computing Machinery |