Complexity of computing distances between geometric trees

Feragen, A

Local TagsRelease HistoryDetailsSummary

Complexity of computing distances between geometric trees

Feragen, A. (2012). Complexity of computing distances between geometric trees. In G. Gimel´farb, E. Hancock, A. Imiya, A. Kuijper, M. Kudo, S. Omachi, et al. (Eds.), Structural, Syntactic, and Statistical Pattern Recognition. Springer.

Item is Released

show all hide all

Basic

show hide

Item Permalink: https://hdl.handle.net/11858/00-001M-0000-000E-FE0B-3 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-000E-FE0D-0

Genre: Conference Paper

Files

show Files

Locators

show

Creators

show

hide

Creators:
Feragen, A¹, Author

Affiliations:
1Research Group Machine Learning and Computational Biology, Max Planck Institute for Intelligent Systems, Max Planck Society, ou_1497644

Content

show

hide

Free keywords: Forschungsgruppe Borgwardt

Abstract: -

Details

show

hide

Language(s):

Dates: Date issued: 2012

Publication Status: Issued

Pages: -

Publishing info: -

Table of Contents: -

Rev. Type: -

Identifiers: BibTex Citekey: FeragenEAAMSTK2012

Degree: -

Event

show

hide

Title: 14th international workshop on Syntactical and Structural Pattern Recognition (S+SSPR 2012)

Place of Event: -

Start-/End Date: -

Legal Case

show

Project information

show

Source 1

show

hide

Title: Structural, Syntactic, and Statistical Pattern Recognition

Source Genre: Proceedings

Creator(s):
Gimel´farb, G., Editor
Hancock, E., Editor
Imiya, A., Editor
Kuijper, A., Editor
Kudo, M., Editor
Omachi, S., Editor
Windeatt, T., Editor
Yamada, K., Editor

Affiliations:
-

Publ. Info: Springer

Pages: - Volume / Issue: - Sequence Number: - Start / End Page: - Identifier: -

Source 2

show

hide

Title: Lecture Notes in Computer Science

Source Genre: Series

Creator(s):

Affiliations:

Publ. Info: -

Pages: - Volume / Issue: 7626 Sequence Number: - Start / End Page: - Identifier: -