English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
 DetailsSummary
  Shortest path distance in random k-nearest neighbor graphs

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.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-000E-FE58-8 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0024-DD39-6
Genre: Conference Paper

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Alamgir, M1, Author           
von Luxburg, U1, 2, Author           
Affiliations:
1Dept. Empirical Inference, Max Planck Institute for Intelligent Systems, Max Planck Society, ou_1497647              
2Research Group Machines Learning Theory, Max Planck Institute for Intelligent Systems, Max Planck Society, ou_1497665              

Content

show
hide
Free keywords: Abt. Schölkopf; Forschungsgruppe Luxburg
 Abstract: -

Details

show
hide
Language(s):
 Dates: 2012
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: BibTex Citekey: Alamgirv2012
 Degree: -

Event

show
hide
Title: International Conference on Machine Learning (ICML 2012)
Place of Event: -
Start-/End Date: -

Legal Case

show

Project information

show

Source 1

show
hide
Title: Proceedings of the 29th International Conference on Machine Learning
Source Genre: Proceedings
 Creator(s):
Langford, J., Editor
Pineau, J., Editor
Affiliations:
-
Publ. Info: New York : Omnipress
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: - Identifier: -