Shortest path distance in random k-nearest neighbor graphs - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Morteza Alamgir, Ulrike von Luxburg. Shortest path distance in random k-nearest neighbor graphs. In Proceedings of the 29th International Conference on Machine Learning, ICML 2012, Edinburgh, Scotland, UK, June 26 - July 1, 2012. icml.cc / Omnipress, 2012. [doi]

This author has not been identified. Look up 'Morteza Alamgir' in GoogleThis author has not been identified. Look up 'Ulrike von Luxburg' in Google

runs on WebDSL