de.mpg.escidoc.pubman.appbase.FacesBean
English
 
Help Guide Disclaimer Contact us Login
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

Shortest path distance in random k-nearest neighbor graphs

MPS-Authors
http://pubman.mpdl.mpg.de/cone/persons/resource/persons83779

Alamgir,  M
Dept. Empirical Inference, Max Planck Institute for Intelligent Systems, Max Planck Society;

http://pubman.mpdl.mpg.de/cone/persons/resource/persons76237

von Luxburg,  U
Research Group Machines Learning Theory, Max Planck Institute for Intelligent Systems, Max Planck Society;
Dept. Empirical Inference, Max Planck Institute for Intelligent Systems, Max Planck Society;

Locator
There are no locators available
Fulltext (public)
There are no public fulltexts available
Supplementary Material (public)
There is no public supplementary material available
Citation

Alamgir, M., & von Luxburg, U. (2012). Shortest path distance in random k-nearest neighbor graphs. In J. Langford, & J. Pineau (Eds.), Proceedings of the 29th International Conference on Machine Learning. New York: Omnipress.


Cite as: http://hdl.handle.net/11858/00-001M-0000-000E-FE58-8
Abstract
There is no abstract available